arXiv · math/9801126
A new algorithm for recognizing the unknot
Abstract
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider the knot as a closed braid, and to use the fact that a knot is unknotted if and only if it is the boundary of a disc with a combinatorial foliation. The main problems which are solved in this paper are: how to systematically enumerate combinatorial braid foliations of a disc; how to verify whether a combinatorial foliation can be realized by an embedded disc; how to find a word in the the braid group whose conjugacy class represents the boundary of the embedded disc; how to check whether the given knot is isotopic to one of the enumerated examples; and finally, how to know when we can stop checking and be sure that our example is not the unknot.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Joan S. Birman, Michael D. Hirsch. 1999-01-04. A new algorithm for recognizing the unknot. https://doi.org/10.2140/gt.1998.2.175
Cite the original work for its findings. Save a collection to share your selection of sources.