Abstract
We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.
Introduction: The Knot Equivalence Problem
In knot theory, a central challenge is determining whether two different-looking knot diagrams represent the same underlying topological loop. In 1926, Kurt Reidemeister established that any two diagrams of the same knot are related by a finite sequence of three local operations, now known as Reidemeister moves.
While Reidemeister proved the existence of such a sequence, he did not provide a bound on its length. Without an upper bound, the problem of knot equivalence remained algorithmically elusive: one could never be certain if two diagrams were truly distinct or if a sufficiently long sequence of moves simply hadn't been discovered. Coward and Lackenby (2011) resolved this 85-year-old problem by deriving an explicit, computable upper bound $F(n)$ based on the number of crossings $n$.
Methodology: Bridging 2D Diagrams and 3D Manifolds
The authors' primary strategy involves translating the 2D diagrammatic problem into the language of 3D manifold topology. They represent the "link exterior"—the 3D space surrounding the knot—using a triangulation composed of tetrahedra.
In this 3D context, the analogues to Reidemeister moves are Pachner moves, which modify a triangulation without altering the underlying manifold's topology.
The proof relies on several key technical pillars:
- Strengthening Mijatović’s Bounds: The authors adapted and extended work by Aleksandar Mijatović regarding Pachner move bounds for 3-manifolds, specifically addressing the complexities of link exterior boundaries.
- Alexander’s Trick: A "bounded" version of this classic topological method was used to control the complexity of deformations between different states of the knot.
- Normal Surface Theory: By utilizing hierarchies of normal surfaces, the authors decomposed 3D space into simpler components to construct a "canonical triangulation" that serves as a universal reference point.
Key Results: The Tower of Exponents
The paper's landmark result is the derivation of an explicit bound for the number of Reidemeister moves. If $D_1$ and $D_2$ are diagrams of the same link with a total of $n$ crossings, $D_2$ can be obtained from $D_1$ by a sequence of at most: $$\exp^{(c^n)}(n) \text{ Reidemeister moves}$$ where $c = 10^{1,000,000}$.
The notation $\exp^{(r)}(x)$ denotes a "tower of exponents" (tetration), where the exponential function is iterated $r$ times. While this bound is astronomically large, its mere existence proves that the link equivalence problem is algorithmically decidable. A brute-force search through all possible move sequences up to this bound will definitively determine if two knots are equivalent.
Conclusion and Future Directions
Coward and Lackenby's work provides a theoretical foundation for knot decidability. However, the "galactic" scale of the bound makes it impractical for actual computation. The constant $c$ is intentionally conservative to ensure the proof's universality. Future research in the field has since focused on tightening these bounds, aiming for single-exponential or even polynomial complexity for specific knot classes.
Summary updated