Narrow Results

In this paper, we study the knotting probability of equilateral random polygons. It is known that such objects are locally knotted with-probability arbitrarily close to one provided the length is sufficiently large ([4]). For Gaussian random polygons, it has been shown that the probability of global knottedness also tends to one as the length of the polygon tends to infinity [8]. In this paper, we prove that global knotting also occurs in equilateral random polygons with a probability approaching one as the length of the polygons goes to infinity.

We prove that the knots $13n_{592}$ and $15n_{41,127}$ both have stick number 10. These are the first non-torus prime knots with more than 9 crossings for which the exact stick number is known.

The knots $8_1$, $8_2$, $8_3$, $8_5$, $8_6$, $8_7$, $8_8$, $8_{10}$, $8_{11}$, $8_{12}$, $8_{13}$, $8_{14}$, $8_{15}$, $9_7$, $9_{16}$, $9_{20}$, $9_{26}$, $9_{28}$, $9_{32}$, and $9_{33}$ all have superbridge index equal to 4. This follows from new upper bounds on superbridge index not coming from the stick number and increases the number of knots from the Rolfsen table for which superbridge index is known from 29 to 49. Appendix A gives the current state of knowledge of superbridge index for prime knots through 10 crossings.

This paper gives new upper bounds on the stick numbers of the knots $9_{18}$, $10_{18}$, $10_{58}$, $10_{66}$, $10_{68}$, $10_{80}$, $10_{82}$, $10_{84}$, $10_{93}$, $10_{100}$, and $10_{152}$, as well as on the equilateral stick number of $10_{79}$. These bounds imply that the knots $10_{58}$, $10_{66}$, and $10_{80}$ have superbridge index $\le 5$, completing the project of showing that no prime knots through 10 crossings can have superbridge index larger than 5. The current best bounds on stick number and superbridge index for prime knots through 10 crossings are given in Appendix A.

Previous work [C. Shonkwiler, New computations of the superbridge index, J. Knot Theory Ramifications 29(14) (2020) 2050096] used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots. This work extends this technique to polygonal realizations with an odd number of edges and determines the exact superbridge index of many new knots, including the majority of the 9-crossing knots for which it was previously unknown and, for the first time, several 12-crossing knots. Interestingly, at least half of these superbridge-minimizing polygonal realizations do not minimize the stick number of the knot; these seem to be the first such examples. Appendix A gives a complete summary of what is currently known about superbridge indices of prime knots through 10 crossings and Appendix B gives all knots through 16 crossings for which the superbridge index is known.

It was proved in [4] that the knotting probability of a Gaussian random polygon goes to 1 as the length of the polygon goes to infinity. In this paper, we prove the same result for the equilateral random polygons in R³. More precisely, if EP_n is an equilateral random polygon of n steps, then we have