Positive braids minimize ascending number
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.
Authors
- Jeffrey Meier (ORCID: https://orcid.org/0000-0002-6671-620X)
- Lowell Davis
Institutions
- Western Washington University (US)
Publication Details
- Journal
- Journal of Knot Theory and Its Ramifications
- Published
- 2025-08-25
- DOI
- https://doi.org/10.1142/s0218216525500725
- Primary Topic
- Law, Economics, and Judicial Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00