[Paper Review] A one-parameter approach to knot theory

Thomas Fiedler, Vitaliy Kurlin|arXiv (Cornell University)|Jun 15, 2006

Geometric and Algebraic Topology2 references10 citations

TL;DR

This paper introduces a one-parameter invariant for oriented knots using trace graphs embedded in a thickened torus, establishing that isotopy equivalence corresponds to a finite set of graph moves. For closed braids with fixed strand count, trace graph equivalence is decidable in polynomial time relative to braid length.

ABSTRACT

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.

Motivation & Objective

• To develop a topological invariant for oriented knots using trace graphs in a thickened torus.
• To characterize knot isotopy through a finite set of standard graph moves on trace graphs.
• To provide an efficient decision procedure for trace graph equivalence in closed braids with fixed strand count.
• To establish a one-to-one correspondence between knot isotopy and trace graph move sequences.

Proposed method

• Construct a trace graph from an oriented knot by tracking the braid closure in a thickened torus.
• Define isotopy of knots as equivalence under a finite set of standard moves on the trace graph.
• Represent closed braids with a fixed number of strands as trace graphs in the thickened torus.
• Apply combinatorial graph moves to determine equivalence, leveraging polynomial-time algorithms for trace graph comparison.
• Use the trace graph's structure to encode braid dynamics and topological invariants.
• Reduce the equivalence problem for closed braids to a graph-theoretic decision problem.

Experimental results

Research questions

• RQ1 Can knot isotopy be fully characterized by a finite set of moves on a trace graph in a thickened torus?
• RQ2 Is there a one-parameter construction that uniquely encodes oriented knot types via trace graphs?
• RQ3 Can trace graph equivalence for closed braids with fixed strand count be decided in polynomial time?
• RQ4 What is the computational complexity of determining trace graph equivalence under the defined move set?

Key findings

• Knot isotopy is equivalent to a finite sequence of standard moves on the trace graph in the thickened torus.
• The trace graph construction provides a complete invariant for oriented knots under isotopy.
• For closed braids with a fixed number of strands, trace graph equivalence is decidable in polynomial time with respect to braid length.
• The method excludes one type of move from the equivalence relation, enabling efficient computation.
• The approach establishes a topological correspondence between knot types and trace graph move classes.
• The framework supports algorithmic recognition of knot equivalence within the closed braid setting.