Let $C\_N$ denote the labelled configuration of $N^{th}$ roots of unity with $p\_J = e^{\frac{2\pi iJ}{N}}$ for $J = 1\ldots N$.


As a corollary of something else I was playing around with, I recently proved the following:


Theorem: Every tame knot (or link) $K$ has a (not necessarily minimal) stick presentation which such that the sticks can be projected onto the set of chords of some $C\_N$ with the following crossing condition: Whenever the projection has chords $p\_{J\_1}p\_{J\_3}$ and $p\_{J\_2}p\_{J\_4}$ such that $1\leq J\_1 < J\_2 < J\_3 < J\_4\leq N$ then $p\_{J\_1}p\_{J\_3}$ crosses in front of $p\_{J\_2}p\_{J\_4}$. (In other words for any two intersecting chords in the projection, the chord which has the lowest numbered endpoint passes in front of the other chord).


Germane to this question is the fact that the theorem leads to a knot invariant which, for lack of a better name, I will call the circular stick number of $K$ and which is defined to be the minimum $N$ needed to obtain a projection of $K$ with the above properties.


My proof of the above theorem was very non-constructive, so I wanted to see some concrete realizations of such projections. And after some work, I was able to find that for the left trefoil knot, the circular stick number is 7. After much more playing around on $C\_7$ and not finding a projection of the right trefoil, I moved on to $C\_8$ where I was able to find a projection of the right trefoil.



> 
> **Main Question:** Does this invariant actually distinguish chiralities of the trefoil, or can someone find a projection of the right trefoil with the above properties on $C\_7$? If it doesn't distinguish chiralities in this case, is it possible it distinguishes chiralities of some other pair of knots, or does anyone see a slick way to see that it cannot distinguish chiralities?
> 
> 
> **Secondary Question:** (Mainly for knot theorists, or anyone with a deeper knowledge of knots than I) Has this invariant been studied before, and if so, what is the terminology used for it?
> 
> 
> 


I am fairly sure that the general answer to the main question is strongly related to the characterization (and in particular the disjointness) of the sets of forbidden minors of the following two sets (which are almost certainly not known in general as the Robertson-Seymour theorem is non-constructive):


$\bullet$ Graphs which are $L$-lessly embeddable for a given chiral knot $L$


$\bullet$ Graphs which are $L^+$-lessly *and* $L^-$-lessly embeddable for a given chiral knot $L$ with chiralities $L^+$ and $L^-$


Note that graphs in the second set may admit embeddings in $\mathbb{R}^3$ containing either $L^+$ or $L^-$, but have at least one embedding which does not contain both $L^+$ and $L^-$. As of yet, I have not been able to flesh out a proof using this approach however.


For those who don't want to search for the solutions I found, for the left trefoil the points of $C\_7$ are connected in the following order:


$p\_1 \rightarrow p\_3 \rightarrow p\_5 \rightarrow p\_7 \rightarrow p\_2 \rightarrow p\_4 \rightarrow p\_6 \rightarrow p\_1$


For the right trefoil the points of $C\_8$ are connected in the following order:


$p\_1 \rightarrow p\_3 \rightarrow p\_7 \rightarrow p\_5 \rightarrow p\_2 \rightarrow p\_8 \rightarrow p\_4 \rightarrow p\_6 \rightarrow p\_1$


 **EDIT:** Here are pictures of these two projections to help clarify the situation:


<https://docs.google.com/open?id=0B5BVGcL23IkoSTlNNGZKZnZtT1E>


With regards to Dylan's question about how this projection arose, I was considering the parametric curve $S(t) = (t,t^2,t^3) \subset \mathbb{R}^3$. In a comment or answer on a past MO post which for the love of me I cannot find now, someone had shown in a very simple way that no two chords of $S$ intersect one another anywhere in $\mathbb{R}^3$ (unless they share an endpoint). Thus, for each $n$, $K\_n$ can be embedded in $\mathbb{R}^3$ as the set of chords connecting the points $(1...n)$. Now for a fixed tame knot or link $K$, the Robertson-Seymour theorem implies there is a finite set of forbidden minors for graphs which are $K$-lessly embeddable. Hence, every embedding of $K\_n$ for $n$ sufficiently large contains $K$, so one may ask (like I did) "what $n$ is sufficient for a given $K$, and what order must I connect the points $(1...n)$ in order to realize $K$?" The crossing condition comes from looking at the chords projected onto the $yz$-plane as viewed from the $-x$ direction (which I think is the direction I did my crossing calculations from). Finally, I moved the $yz$-projections of the integral $t$-valued points around so that they lay on the unit circle to make the pictures easier/clearer.


 **UPDATE:** I was just skimming through a paper on some results on knots which were unrelated to this one. That paper referenced the Ramsey number $r(L)$ of a link $L$, and upon following its references I found this paper which proves the existence of $r(L)$ using essentially the representation I layed out above:


<http://www.ams.org/journals/tran/1991-324-02/S0002-9947-1991-1069741-9/S0002-9947-1991-1069741-9.pdf>


So it would appear the answer to Question 2 is this is known (in at least one paper) as a **plat representation** (much to my surprise, Negami derives the existence of such representations using essentially the argument I gave above). So that would seem to settle this thread entirely...



Does this knot invariant distinguish trefoil chiralities?
I'm very curious where this came up. In any case, the answer to the first question is yes, it does distinguish these trefoils; you found the minimal representatives.


Let $a\_0,\dots,a\_{N-1}$ be the roots of unity that are visited along the knot, in (cyclic) order. Suppose we have a minimal representative for some non-trivial knot. Then we cannot have $|a\_k - a\_{k+1}| = 1$ for any $k$, as otherwise we could replace this pair $a\_k, a\_{k+1}$ by a single root of unity (for $N-1$), adjusting the other roots of unity as appropriate. A little more subtly, we cannot have $|a\_{k-1} - a\_{k+1}| = 1$ either, as then we could again delete $a\_k$ from the sequence to get a smaller representation. With these simple constraints, the smallest possible sequence for a non-trivial knot is the one you found for one of the trefoils with $N=7$. There are several possibilities for $N=8$, including the one you found for the other trefoil. I've included a very short Haskell program below that computes this. The possibilities for $N=8$ are
$$
(2,7,5,3,1,6,4,0)\quad
(2,5,7,3,1,6,4,0)\quad
(3,6,1,4,7,2,5,0)\quad
(2,6,4,1,7,3,5,0)
$$
$$
(3,1,6,4,2,7,5,0)\quad
(2,4,6,1,3,7,5,0)\quad
(3,5,1,7,4,2,6,0)\quad
(4,2,7,5,1,3,6,0)
$$
$$
(3,1,5,7,2,4,6,0)\quad
(5,3,1,6,4,2,7,0)\quad
(2,4,6,1,3,5,7,0)
$$


For the second question, I have never heard of this representation before.


Here is the code, for anyone interested.



```
 -- A (partial) circular stick representation is a list of integers,
 -- the order of the roots of unity to visit in order
 type CircStick = [Int]

 -- The next element ak after a partial representation a1, ..., a{k-1} 
 -- must satisfy
 --   (a) ak has not already been seen
 --   (b) |ak - a{k-1}| > 1
 --   (c) |ak - a{k-2}| > 1
 -- There are a few more "easy" constraint, eg the first and last entries
 -- cannot differ by one.  We do not impose those constraint here.
 nexts :: Int -> CircStick -> [Int]
 nexts n [] = [0]
 nexts n [a1] = filter (\a -> abs (a-a1) > 1) [0..n-1]
 nexts n (a1:a2:as) =
   filter (\a -> not (elem a as)) $
       filter (\a -> abs (a-a1) > 1) $
   filter (\a -> abs (a-a2) > 1) $
     [1..n-1]

 completions :: Int -> CircStick -> [CircStick]
 completions n as | length as >= n = [as]
 completions n as =
   concat [completions n (a:as) | a <- nexts n as]

 -- Impose final constraints:
 --    (a) Last entry cannot be 1
 --    (b) Take entry that is lexicographically less than its reverse
 --    (c) first and next-to-last entries cannot differ by one
 circSticks :: Int -> [CircStick]
 circSticks n = 
   filter (\as -> abs ((as!!0) - (as!!(n-2))) > 1) $
       filter (\as -> as < tail (reverse as)) $
   filter (\as -> head as /= 1) $
   (completions n [])

```

**Edit:** For those interested, here are the 108 possibilities for $N=9$. I hope there's some way of checking what these are more efficiently than just going through them by hand.


[[2,7,5,3,8,1,6,4,0],[2,7,5,3,1,8,6,4,0],[2,5,7,3,1,8,6,4,0],[2,7,5,1,3,8,6,4,0],[2,5,7,1,3,8,6,4,0],[2,6,8,3,5,1,7,4,0],[2,7,5,3,1,6,8,4,0],[2,5,7,3,1,6,8,4,0],[2,7,5,1,3,6,8,4,0],[2,5,7,1,3,6,8,4,0],[3,8,6,1,4,7,2,5,0],[3,6,8,1,4,7,2,5,0],[3,7,1,4,6,8,2,5,0],[2,8,6,4,1,7,3,5,0],[2,6,8,4,1,7,3,5,0],[2,7,4,1,6,8,3,5,0],[2,4,8,6,3,1,7,5,0],[2,4,6,8,3,1,7,5,0],[3,8,1,6,4,2,7,5,0],[3,1,8,6,4,2,7,5,0],[3,6,1,8,4,2,7,5,0],[3,1,6,8,4,2,7,5,0],[2,8,4,6,1,3,7,5,0],[2,4,8,6,1,3,7,5,0],[2,6,4,8,1,3,7,5,0],[2,4,6,8,1,3,7,5,0],[3,7,1,4,6,2,8,5,0],[2,7,4,1,6,3,8,5,0],[3,8,5,1,7,4,2,6,0],[3,7,5,1,8,4,2,6,0],[3,5,7,1,4,8,2,6,0],[4,7,1,3,5,8,2,6,0],[4,1,7,3,5,8,2,6,0],[4,8,2,5,7,1,3,6,0],[4,7,2,5,8,1,3,6,0],[4,2,7,5,1,8,3,6,0],[2,4,7,1,5,8,3,6,0],[2,8,5,3,7,1,4,6,0],[2,7,5,3,8,1,4,6,0],[3,8,1,5,7,2,4,6,0],[3,7,1,5,8,2,4,6,0],[2,7,5,3,1,8,4,6,0],[2,5,7,3,1,8,4,6,0],[3,1,7,5,2,8,4,6,0],[4,2,7,5,3,1,8,6,0],[3,5,1,7,4,2,8,6,0],[4,2,7,5,1,3,8,6,0],[2,4,7,1,5,3,8,6,0],[3,1,5,7,2,4,8,6,0],[5,8,3,1,6,4,2,7,0],[5,3,8,1,6,4,2,7,0],[3,5,8,1,6,4,2,7,0],[5,3,1,8,6,4,2,7,0],[3,5,1,8,6,4,2,7,0],[5,1,3,8,6,4,2,7,0],[5,3,1,6,8,4,2,7,0],[5,1,3,6,8,4,2,7,0],[4,6,1,3,8,5,2,7,0],[4,1,6,3,8,5,2,7,0],[4,6,2,8,5,1,3,7,0],[5,8,2,4,6,1,3,7,0],[5,2,8,4,6,1,3,7,0],[2,6,4,8,1,5,3,7,0],[4,2,6,8,1,5,3,7,0],[2,4,6,8,1,5,3,7,0],[2,6,4,1,8,5,3,7,0],[2,4,6,1,8,5,3,7,0],[2,5,8,3,6,1,4,7,0],[5,3,1,8,6,2,4,7,0],[3,5,1,8,6,2,4,7,0],[5,1,3,8,6,2,4,7,0],[5,3,1,6,8,2,4,7,0],[5,1,3,6,8,2,4,7,0],[4,2,8,6,3,1,5,7,0],[2,4,8,6,3,1,5,7,0],[4,2,6,8,3,1,5,7,0],[2,4,6,8,3,1,5,7,0],[3,6,1,4,8,2,5,7,0],[3,1,6,4,8,2,5,7,0],[2,8,4,6,1,3,5,7,0],[4,2,8,6,1,3,5,7,0],[2,4,8,6,1,3,5,7,0],[2,6,4,8,1,3,5,7,0],[4,2,6,8,1,3,5,7,0],[2,4,6,8,1,3,5,7,0],[2,6,4,1,8,3,5,7,0],[2,4,6,1,8,3,5,7,0],[5,7,3,1,6,4,2,8,0],[4,6,1,3,7,5,2,8,0],[5,3,7,1,4,6,2,8,0],[3,5,7,1,4,6,2,8,0],[6,4,2,7,5,1,3,8,0],[5,7,2,4,6,1,3,8,0],[6,2,4,7,1,5,3,8,0],[2,6,4,1,7,5,3,8,0],[5,2,7,4,1,6,3,8,0],[6,3,1,5,7,2,4,8,0],[6,1,3,5,7,2,4,8,0],[2,7,5,3,1,6,4,8,0],[2,5,7,3,1,6,4,8,0],[3,6,1,4,7,2,5,8,0],[6,2,4,7,1,3,5,8,0],[2,6,4,1,7,3,5,8,0],[4,2,7,5,3,1,6,8,0],[5,3,1,7,4,2,6,8,0],[3,5,1,7,4,2,6,8,0],[4,2,7,5,1,3,6,8,0],[3,1,5,7,2,4,6,8,0]]


