A bound for orderings of Reidemeister moves

Abstract

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.

11 pages, 15 figures; fixed minor typographical error

References in corpus (1)

• Ordering the Reidemeister moves of a classical knot