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.

pdf

Additional Information

ISSN
1080-6377
Print ISSN
0002-9327
Pages
pp. 1023-1066
Launched on MUSE
2014-07-28
Open Access
No
Back To Top

This website uses cookies to ensure you get the best experience on our website. Without cookies your experience may not be seamless.