Stick numbers of $2$-bridge knots and links
Youngsik Huh, Sungjong No, Seungsang Oh

TL;DR
This paper improves the upper bound on the stick number for 2-bridge knots and links, showing they can be constructed with only c(K)+2 sticks, which is tighter than previous bounds.
Contribution
It introduces a new construction method demonstrating that any 2-bridge knot or link with at least six crossings can be built with c(K)+2 sticks, refining existing bounds.
Findings
Constructed 2-bridge knots/links with c(K)+2 sticks
Established a tighter upper bound on stick numbers
Applicable to knots with at least six crossings
Abstract
Negami found an upper bound on the stick number of a nontrivial knot in terms of the minimal crossing number of the knot which is . Furthermore McCabe proved for a -bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we construct any -bridge knot or link of at least six crossings by using only straight sticks. This gives a new upper bound on stick numbers of -bridge knots and links in terms of crossing numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
