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.
Keywords: Reidemeister moves
Gold, Julian  1
@article{10_2140_agt_2013_13_3099,
author = {Gold, Julian},
title = {A bound for orderings of {Reidemeister} moves},
journal = {Algebraic and Geometric Topology},
pages = {3099--3110},
year = {2013},
volume = {13},
number = {6},
doi = {10.2140/agt.2013.13.3099},
url = {http://geodesic.mathdoc.fr/articles/10.2140/agt.2013.13.3099/}
}
Gold, Julian. A bound for orderings of Reidemeister moves. Algebraic and Geometric Topology, Tome 13 (2013) no. 6, pp. 3099-3110. doi: 10.2140/agt.2013.13.3099
[1] , Ordering the Reidemeister moves of a classical knot, Algebr. Geom. Topol. 6 (2006) 659
[2] , , Unknotting genus one knots, Comment. Math. Helv. 86 (2011) 383
[3] , , The number of Reidemeister moves needed for unknotting, J. Amer. Math. Soc. 14 (2001) 399
[4] , On the Reidemeister moves of a classical knot, Proc. Amer. Math. Soc. 89 (1983) 722
Cité par Sources :