Jones's braid-index uniqueness conjecture
Let be the braid index of a link , let be the braid group on strands, let , let and denote their closures, and let denote the exponent sum of a braid word.
Jones's braid-index uniqueness conjecture. If
then
The conjecture asserts that all braid representatives of a link having the minimal braid index have the same exponent sum. It is introduced as one of Jones's still unsolved conjectures and is relevant to whether the Morton–Williams–Franks inequalities for parallel cables can be sharp.
References
Primary source
A. Stoimenow, “On the crossing number of positive knots and braids and braid index criteria of Jones and Morton-Williams-Franks”, arXiv:math/0110016 (2001).
Progress summary
A 2015 paper reports a complete proof, but the claim has not been independently verified, so the problem is not securely closed.
Jones’s conjecture says that two minimum-strand braid representations of the same link have the same exponent sum. It was presented as unresolved in 2001, particularly beyond the -braid case.
Known results
- The -braid case was settled by Birman and Menasco; the -strand case was reported open in 2001.
- Sharpness of the Morton–Franks–Williams inequality implies the conjecture.
- Kawamuro (2006) proved it for many classes, including examples preserved under -cabling and connected sum, and found infinitely many cases where the inequality is non-sharp but the conjecture holds.
2015 reported affirmative solution
A 2015 paper states that the generalized Jones–Kawamuro inequality was solved affirmatively by Dynnikov–Prasolov and LaFountain–Menasco. Applied to two minimum-strand representatives, its right-hand side is , which would imply Jones’s conjecture; the scan found no independent verification or detailed proof assessment.
Current status (as of September 2026): The conjecture has a published report of an affirmative solution, but that resolution remains unverified; no independently confirmed unresolved case or counterexample is recorded.
Sources
- ar5iv.labs.arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- arxiv.org
- mathworld.wolfram.com
- arxiv.org
- archive.lib.msu.edu
- math.charlotte.edu
- researchgate.net
- math.columbia.edu
- webhomes.maths.ed.ac.uk
- scispace.com
- arxiv.org
- arxiv.org
- mathstodon.xyz
- scientificamerican.com
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- github.com
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- arxiv.org
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- arxiv.org
- x.com
- eudml.org
- mathoverflow.net
- arxiv.org
Solutions 0
No solutions have been posted yet.