Year: 2025
Type: article
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.
Authors: Lowell Davis, Jeffrey Meier
Institution: Western Washington University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4413498139
