Mathematics – Geometric Topology
Scientific paper
1998-01-28
Geom. Topol. 2 (1998), 175-220
Mathematics
Geometric Topology
46 pages. Published copy, also available at http://www.maths.warwick.ac.uk/gt/GTVol2/paper9.abs.html
Scientific paper
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.
Birman Joan S.
Hirsch Michael D.
No associations
LandOfFree
A new algorithm for recognizing the unknot does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new algorithm for recognizing the unknot, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new algorithm for recognizing the unknot will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-639587