Unknotting numbers of diagrams of a given nontrivial knot are unbounded
classification
🧮 math.GT
keywords
numberknotunknottingequalnontrivialcrossingdiagramdiagrams
read the original abstract
We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than or equal to the crossing number of $K$ minus one. We show that the equality holds only when $K$ is a $(2,p)$-torus knot.
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.