English

Positive braids minimize ascending number

Geometric Topology 2024-09-27 v2

Abstract

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the ascending number of the knot. The ascending number is bounded below by the unknotting number. We show that for knots obtained as the closure of a positive braid, the ascending number equals the unknotting number. We also present data indicating that a similar result may hold for positive knots. We use this data to examine which low-crossing knots have the property that their ascending number is realized in a minimal crossing diagram, showing that there are at most 5 hyperbolic, alternating knots with at most 12 crossings with this property.

Keywords

Cite

@article{arxiv.2409.15490,
  title  = {Positive braids minimize ascending number},
  author = {Lowell Davis and Jeffrey Meier},
  journal= {arXiv preprint arXiv:2409.15490},
  year   = {2024}
}

Comments

9 pages, 4 figures, 2 tables; comments welcome; v2 updates Question 4, which is easily answered in the negative for strongly quasipositive knots

R2 v1 2026-06-28T18:54:25.837Z