Papers › New Superbridge Index Calculations from Non-Minimal Realizations
New Superbridge Index Calculations from Non-Minimal Realizations
Clayton Shonkwiler
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Previous work 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. The present 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections