pith. sign in

arxiv: math/0409351 · v2 · submitted 2004-09-20 · 🧮 math.GT

The 2-bridge knots of up to 16 crossings

classification 🧮 math.GT
keywords bridgeknotscrossingsknotnumberdeterminegivennumbers
0
0 comments X
read the original abstract

For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of whether a given (prime) knot is a 2-bridge knot remains a nontrivial exercise, and we have no procedure to determine bridge numbers more generally. Herein, we identify the 2-bridge knots within the Hoste--Thistlethwaite--Weeks tables of prime knots of up to 16 crossings by an exhaustive search of a larger set of 2-bridge knots. As the unknot is the only knot with bridge number 1, this yields a lower bound of 3 for the bridge numbers of the remaining knots.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.