An upper bound on Reidemeister moves

Abstract

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.

40 pages, 14 figures; v2: very minor changes