A 1-parameter approach to links in a solid torus

Thomas Fiedler, Vitaliy Kurlin

Abstract

To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a study of codimension 2 singularities of link diagrams. For closed braids with a fixed number of strands, trace graphs can be recognized up to equivalence excluding one type of moves in polynomial time with respect to the braid length.

Introduction

In knot theory, links—collections of intertwined loops—are typically studied using 2D diagrams and the three classical Reidemeister moves. However, classifying links within a solid torus (a donut-shaped space) presents unique challenges compared to standard 3D space. This problem is intrinsically linked to the braid conjugacy problem: determining if two braids are topologically equivalent.

While algebraic solutions exist for braids with few strands, an efficient polynomial-time solution for braids with five or more strands has remained elusive due to "exponential explosion" in algebraic representations. This paper introduces a geometric alternative: the trace graph.

The Trace Graph Methodology

The authors move from static 2D projections to a dynamic 1-parameter approach. By rotating a link inside a solid torus around its central axis, they generate a continuous family of 2D projections.

Evolution of a link diagram during rotation at different time intervals.

As the link rotates, the union of these projections over a full $360^\circ$ rotation forms a 2-dimensional "diagram surface" within a thickened torus. The trace graph is defined as the set of self-intersections of this surface. It serves as a geometric "fingerprint," capturing how crossings appear, disappear, and slide past one another during the rotation process.

Key Insights: From Topology to Combinatorics

The trace graph effectively compresses a complex 3D topological problem into a 2D combinatorial object embedded in a 3D space. To ensure this graph is a robust invariant, the authors utilize singularity theory—specifically codimension-2 singularities—to identify 11 specific "moves" that transform the trace graph of one link into another if the links are isotopic.

A trace graph showing the paths of self-intersections (crossings) over time $t$.

A significant conceptual shift is the introduction of "strong isotopy," a stricter equivalence that forbids the creation of new local maxima or minima during deformation. This constraint aligns naturally with the study of closed braids.

Results and Complexity

The paper establishes two primary theorems:

  1. Theorem 1.4 (Classification): Two links in a solid torus are isotopic if and only if their labeled trace graphs are related by a finite sequence of 11 standard moves.
  2. Theorem 1.5 (Polynomial Complexity): For closed braids with a fixed number of strands $n$, trace graphs can be recognized in polynomial time relative to the braid length $l$.

The complexity bound is given as $C(n/2)^{n^2/8}(6l)^{n^2-n+1}$. While the exponent depends on the number of strands, for any fixed $n$, the computation time grows only as a power of the braid's length, marking a substantial improvement over traditional algebraic methods.

Limitations and Future Directions

The polynomial-time result is "fixed-parameter tractable," meaning complexity still scales rapidly as the number of strands $n$ increases. Additionally, the current algorithm for braids excludes one specific move related to strong isotopy, though the authors suggest this move is often redundant for classification. Future work may focus on developing visualization software to handle these complex 2D objects in a 3D thickened torus more intuitively.

Summary updated

Abstract

To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a study of codimension~2 singularities of link diagrams. For closed braids with a fixed number of strands, trace graphs can be recognized up to equivalence excluding one type of moves in polynomial time with respect to the braid length.
BibTeX
@article{fiedler2010parameter,
  author = {Thomas Fiedler and Vitaliy Kurlin},
  title = {{A 1-parameter approach to links in a solid torus}},
  journal = {Journal of the Mathematical Society of Japan},
  year = {2010},
  doi = {10.2969/jmsj/06210167},
}

Loading related content...

Figure