-
An upper bound on Reidemeister moves
- American Journal of Mathematics
- Johns Hopkins University Press
- Volume 136, Number 4, August 2014
- pp. 1023-1066
- 10.1353/ajm.2014.0027
- Article
- Additional Information
- Purchase/rental options available:
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.