Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 41 min ago
PreprintCC BY 4.0arXiv

Computation of unknotting numbers: which knot breaks the Bernhard-Jablan Conjecture

Abstract

We determine $2,540$ unknotting numbers of prime knots with at most $13$ crossings, that are unknown in the KnotInfo snapshot of 9 September 2026. The lower-bound calculations use Heegaard Floer correction-term obstructions and Greene's spanning-tree model. We also give explicit crossing-change constructions for upper bounds. For $959$ alternating knots with range [2,3], we verify that no crossing change in a minimal diagram gives a knot of unknotting number one. We determine the unknotting numbers of all four knots in Brittenham and Hermiller's construction and thereby identify 13n3370 as an explicit counterexample to the original Bernhard-Jablan conjecture.

Related

  1. Ascending, Bridge, and Unknotting Numbers of Knotted Graphs
    Bahar Acu, Puttipong Pongtanapaisan, Ritikaa Singhal
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. Higher order unknotting numbers for knots and links
    Jean-Baptiste Meilhan, Harumi Ogita, Akira Yasuhara
    HALPreprintCC BY-NC-ND 4.0Full textGeometry & topologyHALarXiv
  3. Negative-Definite Plumbings and New Unknotting Numbers
    Seong-Jin Lee
    arXivPreprintCC BY 4.0Full textGeometry & topologyHigh-energy & particle physicsarXiv
  4. The topological Bárány-Larman conjecture for prime numbers
    Pablo Soberón
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. A Short Proof of a Conjecture Regarding Quadratic Representations of Practical Numbers
    Ting Hon Stanford Li
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{lee2026computation,
  title = {{Computation of unknotting numbers: which knot breaks the Bernhard-Jablan Conjecture}},
  author = {Seong-Jin Lee},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.09861},
  eprint = {2609.09861},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09861},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Computation of unknotting numbers: which knot breaks the Bernhard-Jablan Conjecture
AU  - Seong-Jin Lee
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2609.09861
UR  - https://arxiv.org/abs/2609.09861
AB  - We determine $2,540$ unknotting numbers of prime knots with at most $13$ crossings, that are unknown in the KnotInfo snapshot of 9 September 2026. The lower-bound calculations use Heegaard Floer correction-term obstructions and Greene's spanning-tree model. We also give explicit crossing-change constructions for upper bounds. For $959$ alternating knots with range [2,3], we verify that no crossing change in a minimal diagram gives a knot of unknotting number one. We determine the unknotting numbers of all four knots in Brittenham and Hermiller's construction and thereby identify 13n3370 as an explicit counterexample to the original Bernhard-Jablan conjecture.
ER  -