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: | Coward, A, Lackenby, M |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Johns Hopkins University Press
2014
|
Similar Items
-
A polynomial upper bound on Reidemeister moves
by: Lackenby, M
Published: (2015) -
Reidemeister type moves for knots and links in lens spaces
by: Manfredi Enrico, et al.
Published: (2012-06-01) -
The Reidemeister graph is a complete knot invariant
by: Barbensi, A, et al.
Published: (2020) -
A remark on Schottky representations and Reidemeister torsion
by: F. Hezenci Hezenci, et al.
Published: (2023-03-01) -
A remark on Schottky representations and Reidemeister torsion
by: F. Hezenci, et al.
Published: (2023-03-01)