A new algorithm for recognizing the unknot

DOI10.2140/gt.1998.2.175zbMath0955.57005arXivmath/9801126OpenAlexW3098135018WikidataQ29544207 ScholiaQ29544207MaRDI QIDQ1279535

Joan S. Birman, Michael D. Hirsch

Publication date: 7 February 1999

Published in: Geometry \& Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9801126

zbMATH Keywords

knotfoliationbraid

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General geometric structures on low-dimensional manifolds (57M50) Relations of low-dimensional topology with graph theory (57M15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Obstructions to trivializing a knot, POST QUANTUM CRYPTOGRAPHY FROM MUTANT PRIME KNOTS, Rectangular knot diagrams classification with deep learning, TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT, A quantitative Birman–Menasco finiteness theorem and its application to crossing number, Notes on tiled incompressible tori, Braid ordering and the geometry of closed braid, The number of Reidemeister moves needed for unknotting, Diagram invariants of knots and the Kontsevich integral, Stabilization in the braid groups. I: MTWS, Open book foliation, BRAID ORDERING AND KNOT GENUS, The Unknotting Problem, Algorithmic simplification of knot diagrams: New moves and experiments, AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

Cites Work

• Unnamed Item
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Representation of links by braids: A new algorithm
• The minimal number of Seifert circles equals the braid index of a link
• A new approach to the word and conjugacy problems in the braid groups
• Band-generator presentation for the 4-braid group
• Algorithms for recognizing knots and 3-manifolds
• The computational complexity of knot and link problems
• Studying Links Via Closed Braids. V: The Unlink
• THE GENUS OF CLOSED 3-BRAIDS
• ALGORITHMS FOR POSITIVE BRAIDS
• STUDYING SURFACES VIA CLOSED BRAIDS
• On the computational complexity of the Jones and Tutte polynomials
• THE BRAID GROUP AND OTHER GROUPS