An upper bound on Reidemeister moves
Geometric Topology
2011-06-21 v2
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.
Cite
@article{arxiv.1104.1882,
title = {An upper bound on Reidemeister moves},
author = {Alexander Coward and Marc Lackenby},
journal= {arXiv preprint arXiv:1104.1882},
year = {2011}
}
Comments
40 pages, 14 figures; v2: very minor changes