A one-parameter approach to knot theory

Thomas Fiedler, Vitaliy Kurlin

Abstract

To an oriented knot we associate a trace graph in a thickened torus in such a way that knots are isotopic if and only if their trace graphs can be connected by moves of finitely many standard types. For closed braids with a fixed number of strands, we recognize trace graphs up to equivalence excluding one type of moves in polynomial time with respect to the braid length.

Introduction: Beyond Static Diagrams

In classical knot theory, 3D knots are typically represented by 2D plane diagrams. Two knots are considered isotopic if their diagrams can be transformed into one another via a series of Reidemeister moves. However, this approach encounters significant challenges when dealing with links in a solid torus—a space topologically equivalent to a thickened circle.

Classifying links in a solid torus is mathematically equivalent to the braid conjugacy problem: determining if two braids are essentially the same. This problem is notoriously difficult in algebra and topology, particularly as the number of strands ($n$) increases. For $n \ge 5$, efficient polynomial-time solutions have historically been elusive. This paper introduces a geometric alternative to traditional algebraic methods by shifting the focus from static diagrams to dynamic "trace graphs."

Geometric representations of links in a solid torus, including the Morton unknot and a non-trivial braid.

The One-Parameter Approach and Trace Graphs

The authors propose a "1-parameter approach" that utilizes the rotational symmetry of the solid torus. The method involves several key steps:

  1. Rotation: A link inside a solid torus is rotated $360^\circ$ around the central axis.
  2. Trace Graphs: As the link rotates, the crossings in its 2D projection move, disappear, or are created. By tracking the trajectories of these crossings in a thickened torus, the authors construct a combinatorial object called a trace graph.
  3. Higher-Order Reidemeister Theorem: The paper proves that two links are isotopic if and only if their trace graphs can be transformed into one another using a finite set of 11 specific moves, which serve as higher-order analogues to the standard Reidemeister moves.
A trace graph representing the trajectories of crossings as a link rotates in a solid torus.

The core of the proof involves analyzing "codimension 2" singularities—rare geometric events during rotation, such as four arcs crossing at a single point or a crossing becoming tangent to a horizontal line. These events define the moves between trace graphs.

Key Insights and Results

The transition from static to dynamic representations provides a unique "fingerprint" for knots that is more robust than a single projection. By transforming an algebraic problem into a graph-theory problem—specifically the isotopy of graphs in a thickened torus—the authors unlock new algorithmic possibilities.

Key Results include: * Theorem 1.4: The establishment of a complete set of 11 moves required to determine equivalence between trace graphs. * Computational Complexity: The authors present an algorithm to recognize trace graphs of closed braids. For a fixed number of strands $n$ and braid length $l$, the algorithm runs in polynomial time relative to $l$, specifically $O(l^{n^2-n+1})$. * Pure Braids: For pure braids, the complexity is further reduced, making this geometric approach significantly more efficient than existing algebraic methods for this class.

Limitations and Future Work

While the 1-parameter approach is a significant step forward, some challenges remain. The current polynomial-time algorithm excludes one specific type of move—the "extreme tangency" move—whose full incorporation remains an open problem. Additionally, while the algorithm is polynomial in braid length, the complexity grows rapidly with the number of strands $n$.

Future research may extend this 1-parameter approach to other manifolds or use the geometry of trace graphs to develop new knot invariants. The authors acknowledge that the exponential growth of conjugacy classes, even for 3 strands, remains a fundamental hurdle for general classification.

Summary updated

Abstract

To an oriented knot we associate a trace graph in a thickened torus in such a way that knots are isotopic if and only if their trace graphs can be connected by moves of finitely many standard types. For closed braids with a fixed number of strands, we recognize trace graphs up to equivalence excluding one type of moves in polynomial time with respect to the braid length.
BibTeX
@article{fiedler2010one,
  author = {Thomas Fiedler and Vitaliy Kurlin},
  title = {{A one-parameter approach to knot theory}},
  journal = {Journal of the Mathematical Society of Japan},
  year = {2010},
  doi = {10.2969/jmsj/06210167},
}
Figure