The Generalized Kauffman-Harary Conjecture is True
Rhea Palak Bakshi, Huizheng Guo, Gabriel Montoya-Vega, Sujoy Mukherjee, J\'ozef H. Przytycki

TL;DR
This paper proves a generalized version of the Kauffman-Harary conjecture, showing that for prime links with a given determinant, distinct arcs can be distinguished by an appropriate Fox coloring.
Contribution
It extends the Kauffman-Harary conjecture to all prime links with arbitrary determinants, confirming the conjecture's validity in a broader context.
Findings
The conjecture holds for all prime links with prime determinants.
Distinct arcs in reduced alternating diagrams can be distinguished by specific Fox colorings.
The proof generalizes previous results limited to prime determinants.
Abstract
For a reduced alternating diagram of a knot with a prime determinant the Kauffman-Harary conjecture states that every non-trivial Fox -coloring of the knot assigns different colors to its arcs. In this paper, we prove a generalization of the conjecture stated nineteen years ago by Asaeda, Przytycki, and Sikora: for every pair of distinct arcs in the reduced alternating diagram of a prime link with determinant there exists a Fox -coloring that distinguishes them.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Biochemical and Structural Characterization · semigroups and automata theory
