Unknotting numbers of diagrams of a given nontrivial knot are unbounded
Kouki Taniyama

TL;DR
The paper proves that for any nontrivial knot, diagrams with arbitrarily large unknotting numbers exist, and it characterizes when the crossing number equals twice the unknotting number.
Contribution
It demonstrates the unboundedness of unknotting numbers of diagrams for nontrivial knots and characterizes the cases of equality with crossing number.
Findings
Unknotting numbers of diagrams of nontrivial knots are unbounded.
Equality between crossing number and twice the unknotting number holds only for (2,p)-torus knots.
Provides a characterization of knots where the crossing number equals twice the unknotting number.
Abstract
We show that for any nontrivial knot and any natural number there is a diagram of such that the unknotting number of is greater than or equal to . It is well known that twice the unknotting number of is less than or equal to the crossing number of minus one. We show that the equality holds only when is a -torus knot.
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.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · semigroups and automata theory
