On the bridge number of knot diagrams with minimal crossings

Jae-Wook Chung, Xiao-Song Lin

Published 2003-01-28Version 1

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.