The number of Reidemeister Moves Needed for Unknotting

Details The number of Reidemeister Moves Needed for Unknotting The number of Reidemeister Moves Needed for Unknotting

1998-07-02

arxiv.org/abs/math/9807012v1

J. Amer. Math. Soc. 14 (2001), 399--428.

Mathematics

Geometric Topology

48 pages, 14 figures

Scientific paper

There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A similar result holds for elementary moves on a polygonal knot $K$ embedded in the 1-skeleton of the interior of a compact, orientable, triangulated $PL$ 3-manifold $M$. There is a positive constant $c_2$ such that for each $t \geq 1$, if $M$ consists of $t$ tetrahedra, and $K$ is unknotted, then there is a sequence of at most $2^{c_2 t}$ elementary moves in $M$ which transforms $K$ to a triangle contained inside one tetrahedron of $M$. We obtain explicit values for $c_1$ and $c_2$.

Affiliated with

Also associated with

No associations

Rating

The number of Reidemeister Moves Needed for Unknotting 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 The number of Reidemeister Moves Needed for Unknotting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of Reidemeister Moves Needed for Unknotting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246155