arXiv Analytics

Sign in

arXiv:0711.2350 [math.GT]AbstractReferencesReviewsResources

Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle

Joel Hass, Tahl Nowik

Published 2007-11-15Version 1

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

Categories: math.GT
Subjects: 57M25
Related articles: Most relevant | Search more
arXiv:math/0501490 [math.GT] (Published 2005-01-27)
A lower bound for the number of Reidemeister moves of type III
arXiv:math/0005108 [math.GT] (Published 2000-05-11)
Invariants of knot diagrams and relations among Reidemeister moves
arXiv:math/9807012 [math.GT] (Published 1998-07-02)
The number of Reidemeister Moves Needed for Unknotting

Links

Toolbox