An upper bound on Reidemeister moves
The paper under review gives a remarkable upper bound for the number of Reidemeister moves changing one diagram to another one of the same link. As a preceding work, \textit{J. Hass} and \textit{J. C. Lagarias} [J. Am. Math. Soc. 14, No. 2, 399--428 (2001; Zbl 0964.57005)] showed that any unknotted knot diagram with \(n\) crossings can be transformed to the trivial knot diagram using at most \(2^{cn}\) Reidemeister moves, where \(c=10^{11}\). Thus the present paper answers the general case. Here is the precise statement. Let \(D_1\) and \(D_2\) be connected diagrams of the same knot or link, and let \(n\) be the sum of their crossing numbers. Then \(D_2\) can be obtained from \(D_1\) by at most \(\mathrm{exp}^{(c^n)}(n)\) Reidemeister moves, where \(c=10^{1,000,000}\). The function \(\mathrm{exp}(n)\) is the exponential function \(2^n\), and \(\mathrm{exp}^{(r)}(n)\) is its \(r\)-fold iteration. This also gives a simple solution to the equivalence problem of links.NEWLINENEWLINEThe argument uses triangulations and Pachner moves. It is known that any two triangulations of a PL manifold are related by a sequence of Pachner moves. The key is a result of \textit{A. Mijatović} [Math. Res. Lett. 12, No. 5--6, 843--856 (2005; Zbl 1083.57028)] which gives an upper bound for the number of Pachner moves required to pass between two triangulations of a link exterior. But Mijatović's result is not sufficient here, so a strengthened version is prepared.
- Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
- The number of Reidemeister moves for splitting a link
- A bound for orderings of Reidemeister moves
- The second Reidemeister moves and colorings of virtual knot diagrams
- A LOWER BOUND FOR THE NUMBER OF REIDEMEISTER MOVES FOR UNKNOTTING
- Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves
- Unknotting operations involving trivial tangles
- Simplical structures of knot complements
- The number of Reidemeister moves needed for unknotting
- Boundary-twisted normal form and the number of elementary moves to unknot
- Models of random knots
- Untangling planar curves
- The number of Reidemeister moves for splitting a link
- The size of triangulations supporting a given link
- Two-dimensional state sum models and spin structures
- Bounds on Pachner moves and systoles of cusped 3-manifolds
- The Reidemeister graph is a complete knot invariant
- Traversing three-manifold triangulations and spines
- Diagrammatic state sums for 2D pin-minus TQFTs
- When can a link be obtained from another using crossing exchanges and smoothings?
- The number of Reidemeister moves needed for unknotting
- Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves
- On the complexity of torus knot recognition
- A bound for orderings of Reidemeister moves
- CROSSING NUMBER OF LINKS FORMED BY EDGES OF A TRIANGULATION
- A polynomial upper bound on Reidemeister moves
- NP-hard problems naturally arising in knot theory
- Rectangular knot diagrams classification with deep learning
- Link crossing number is NP-hard
- Visual Algebraic Proofs for Unknot Detection
- The computational complexity of knot genus in a fixed 3‐manifold
- Knots, Diagrams and Kids’ Shoelaces. On Space and their Forms
- Complexity of ice quiver mutation equivalence
- Boundary-twisted normal form and the number of elementary moves to unknot
This page was built for publication: An upper bound on Reidemeister moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879440)
