Recognition: unknown
An upper bound on Reidemeister moves
classification
🧮 math.GT
keywords
boundmovesreidemeisterupperconceptuallydiagramsequivalenceexplicit
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.