An upper bound on Reidemeister moves
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.
Main Authors: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Johns Hopkins University Press
2014
|