arXiv Analytics

Sign in

arXiv:1111.7000 [math.GT]AbstractReferencesReviewsResources

A bound for orderings of Reidemeister moves

Julian Gold

Published 2011-11-29, updated 2011-12-01Version 2

We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.

Comments: 11 pages, 15 figures; fixed minor typographical error
Categories: math.GT
Subjects: 57M25
Related articles: Most relevant | Search more
arXiv:1512.03592 [math.GT] (Published 2015-12-11)
An upper bound on stick numbers of knots
arXiv:1007.3278 [math.GT] (Published 2010-07-19, updated 2011-01-20)
Upper bounds in the Ohtsuki-Riley-Sakuma partial order on 2-bridge knots
arXiv:1007.0695 [math.GT] (Published 2010-07-05)
Dehn surgeries on the figure eight knot: an upper bound for the complexity

Links

Toolbox