arXiv Analytics

Sign in

arXiv:1104.1882 [math.GT]AbstractReferencesReviewsResources

An upper bound on Reidemeister moves

Alexander Coward, Marc Lackenby

Published 2011-04-11, updated 2011-06-20Version 2

We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.

Comments: 40 pages, 14 figures; v2: very minor changes
Categories: math.GT
Subjects: 57M25, 57N10
Related articles: Most relevant | Search more
arXiv:0711.2350 [math.GT] (Published 2007-11-15)
Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
arXiv:math/9807012 [math.GT] (Published 1998-07-02)
The number of Reidemeister Moves Needed for Unknotting
arXiv:0903.1789 [math.GT] (Published 2009-03-10, updated 2009-04-22)
Ordering the Reidemeister moves of a classical knot

Links

Toolbox