TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT

DOI10.1142/S0218216502001858zbMath1007.57004arXivmath/0102177OpenAlexW2029523783MaRDI QIDQ4549836

Sebastiano Vigna, Joan S. Birman, Paolo Boldi, Marta Rampichini

Publication date: 22 March 2003

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmfoliationbraidunknot

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) General geometric structures on low-dimensional manifolds (57M50) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04)

Related Items

Stabilization in the braid groups. I: MTWS, AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS

Cites Work

• 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
• A new algorithm for recognizing the unknot
• The first 1,701,936 knots
• Band-generator presentation for the 4-braid group
• Genera of some closed 4-braids
• Algorithms for recognizing knots and 3-manifolds
• Bemerkungen zur Knotentheorie
• A small state sum for knots
• The number of Reidemeister moves needed for unknotting
• The computational complexity of knot and link problems
• An irreducible 4-string braid with unknotted closure
• Studying Links Via Closed Braids. V: The Unlink
• Quasipositive plumbing (constructions of quasipositive knots and links, V)
• Free subgroups of certain one-relator groups defined by positive words
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• On a theorem of V. I. arnol'd