Towards an implementation of the B-H algorithm for recognizing the unknot

Journal of Knot Theory and its Ramifications

Volumn 11, Issue 4 SPEC., 2002, Pages 601-645

  Birman, Joan S ^a   Rampichini, Marta ^b   Boldi, Paolo ^b   Vigna, Sebastiano ^b  

^a Barnard College of Columbia University   (United States)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036019338     PISSN: 02182165     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218216502001858     Document Type: Conference Paper

References (30)

1. Studying surfaces via closed braids
2. A new algorithm for recognizing the unknot
3. A new approach to the word and conjugacy problems in the braid groups
4. Studying links via closed braids IV: Composite links and split links
5. Studying links via closed braids V: The unlink
6. A small state sum for knots
7. Bemerkunger zur Knotentheorie
8. Theorie der normalflachen
9. Algorithms for recognizing knots and 3-manifolds
10. The number of reidemeister moves needed for unknotting
11. The computational complexity of knot and link problems
12. The first 1,701,936 knots
13. Algorithms for the complete decomposition of a closed 3-manifold
14. Finding all the elementary circuits of a directed graph
15. Band presentation for the 4-braid group
16. Geschlossene flachen in dreidimensionalen mannigfaligkeiten
17. Genera of some closed 4-braids
18. On a theorem of V.H. Arnold
19. Exchangeable braids
20. Threading knot diagrams
21. An irreducible 4-braid with unknotted closure
22. Quasipositive plumbing (constructions of quasipositive knots and links, V)
23. An efficient algorithm for generating necklaces with fixed density
24. Representation of links by braids: A new algorithm
25. The minimal number of Seifert circles equals the braid index of a link