arXiv · math/0301320
On the bridge number of knot diagrams with minimal crossings
Abstract
Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then $1+\sqrt{1+c(D)} \leq b(D)\leq c(D)$. These inequalities are shape in the sense that the upper bound of $b(D)$ is achieved by alternating knots and the lower bound of $b(D)$ is achieved by torus knots. The second inequality becomes an equality only when the knot is an alternating knot. We prove that the first inequality becomes an equality only when the knot is a torus knot.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jae-Wook Chung, Xiao-Song Lin. 2003-01-28. On the bridge number of knot diagrams with minimal crossings. https://doi.org/10.1017/s0305004104007753. https://searcharxiv.com/abs/math/0301320
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.