A New Invariant for Prime Alternating Knots From Error-Correcting Codes

Technical Summary: A New Invariant for Prime Alternating Knots From Error-Correcting Codes

Problem Statement
The fundamental problem addressed in this work is the determination of whether two knots are equivalent. While knot invariants are powerful tools for distinguishing non-equivalent knots (the "negative problem"), many classical invariants, such as specific knot polynomials, fail to distinguish between certain distinct knots, particularly mutant knots or those with identical polynomial invariants. The paper focuses specifically on the class of prime alternating knots, a central family in knot theory that admits associated graph constructions, thereby creating a bridge between knot theory and combinatorial structures.

Methodology
The authors construct a new invariant by integrating coding theory with knot theory, building upon the framework established in prior work [23]. The methodology proceeds through the following steps:

1. Knot Colorings and Matrices: The paper utilizes Alexander-Briggs (AB) colorings, which assign values to the vertices of a Tait diagram (a specific representation of a knot diagram with checkerboard coloring and dots indicating over/under strands). These colorings satisfy linear equations over a commutative ring $R$ with a fixed invertible element $t$.
2. Code Construction: The linear equations derived from AB colorings are stored in a matrix, the kernel of which defines the Alexander-Briggs code ($A_D$). The paper establishes that for a Tait diagram, the AB code is equivalent to the intersection (hull) of the black code ($C_D$) and the white code ($C_{D^*}$), which are cycle codes derived from the incidence matrices of the black and white graphs associated with the diagram.
3. Graph Operations and Duality: The authors leverage the correspondence between alternating knot diagrams and signed planar graphs. They utilize graph operations (deletion and contraction of edges) and their coding-theoretic counterparts (puncturing and shortening of codes) to analyze the structural properties of these codes.
4. Invariance under Flyping: The core of the proof relies on Tait's Flyping Conjecture (proven by Menasco and Thistlethwaite), which states that any two reduced alternating diagrams of a prime link are equivalent if and only if they are related by a finite sequence of flype moves. The authors demonstrate that a flype operation on a knot diagram corresponds to specific transformations in the associated graph and its cycle code.

Key Contributions and Results

• The Main Theorem (Theorem 1 / Theorem 38): The paper proves that the $(\pm 1)$-permutation equivalence class of the Alexander-Briggs code $A_D$ of a reduced Tait diagram $D$ of a prime alternating knot is an invariant of the knot.
  • Technical Note: The authors specify $(\pm 1)$-permutation equivalence (permuting coordinates and multiplying by $\pm 1$) rather than standard monomial equivalence. This distinction is crucial because the hull of a code is invariant under $(\pm 1)$-permutation equivalence but not necessarily under general monomial equivalence.
• Proof of Invariance: The proof shows that a flype move transforms the graph $\Gamma$ to $\Gamma'$. By analyzing the deletion and contraction of the edge corresponding to the flype twist, the authors demonstrate that the resulting cycle codes $C_\Gamma$ and $C_{\Gamma'}$ are $(\pm 1)$-permutation equivalent. Since the Alexander-Briggs code is the hull of the cycle code, and the hull preserves this equivalence class, the AB code is an invariant.
• Comparison with Existing Invariants:
  • The paper provides examples where the new invariant distinguishes knots that share the same Tutte polynomial, Jones polynomial, and Alexander polynomial.
  • Specifically, Example 42 demonstrates two knots ($11a317$ and $11a67$) with identical Tutte polynomials but distinct AB codes (different dimensions over $\mathbb{F}_5$).
  • Example 43 presents two alternating links with identical Tutte, Alexander, and Jones polynomials (and identical HOMFLY polynomials) where the new invariant successfully distinguishes them based on the non-equivalence of their graph codes.
• Limitations regarding Mutant Knots: The paper investigates mutant knots (knots related by a 180-degree rotation of a tangle). The authors prove (Theorem 45) that the graph codes of a knot and its mutant are $(\pm 1)$-permutation equivalent. Consequently, this new invariant does not distinguish mutant knots, a limitation shared by many classical polynomial invariants.

Significance and Claims
The paper claims to provide a new, computable invariant for prime alternating knots derived from the intersection of coding theory and knot theory. Its significance lies in:

1. Novelty: It introduces a coding-theoretic perspective to knot invariants, specifically utilizing the Alexander-Briggs code and its relationship to graph cycle codes.
2. Discriminatory Power: It offers a tool that can separate knots where well-known polynomial invariants (including the Jones and Alexander polynomials) fail, as demonstrated by the provided examples.
3. Theoretical Connection: It reinforces the deep connection between knot theory and combinatorial structures (graphs and codes), showing that properties of the Alexander-Briggs code are robust under the flyping moves that characterize the equivalence of prime alternating knots.

The authors maintain a modest scope, restricting the main theorem to prime alternating knots due to the reliance on Tait's Flyping Conjecture. They note that while the conjecture is often stated without the "prime" assumption in literature, the proof relies on it, and no counterexamples for non-prime alternating knots are currently known. The paper concludes that deciding the equivalence of reduced alternating diagrams is a polynomial-time problem, and this new invariant fits within that computational framework.