Smallest number of edges of an equivalent polygonal path for a knot
In the mathematical theory of knots, the stick number is a knot invariant that intuitively gives the smallest number of straight "sticks" stuck end to end needed to form a knot. Specifically, given any knot , the stick number of , denoted by , is the smallest number of edges of a polygonal path equivalent to .
Six is the lowest stick number for any nontrivial knot. There are few knots whose stick number can be determined exactly. Gyo Taek Jin determined the stick number of a -torus knot in case the parameters and are not too far from each other:[1]
, if
The same result was found independently around the same time by a research group around Colin Adams, but for a smaller range of parameters.[2]
Adams, C. C. (2004), The Knot Book: An elementary introduction to the mathematical theory of knots, Providence, RI: American Mathematical Society, ISBN0-8218-3678-1.
Adams, Colin C.; Brennan, Bevin M.; Greilsheimer, Deborah L.; Woo, Alexander K. (1997), "Stick numbers and composition of knots and links", Journal of Knot Theory and its Ramifications, 6 (2): 149–161, doi:10.1142/S0218216597000121, MR1452436
Eddy, Thomas D.; Shonkwiler, Clayton (2019), New stick number bounds from random sampling of confined polygons, arXiv:1909.00917
Jin, Gyo Taek (1997), "Polygon indices and superbridge indices of torus knots and links", Journal of Knot Theory and its Ramifications, 6 (2): 281–289, doi:10.1142/S0218216597000170, MR1452441
Negami, Seiya (1991), "Ramsey theorems for knots, links and spatial graphs", Transactions of the American Mathematical Society, 324 (2): 527–541, doi:10.2307/2001731, MR1069741