A bound for orderings of Reidemeister moves
classification
🧮 math.GT
keywords
boundmovesreidemeisternumberrequireddiagramslinkordered
read the original abstract
We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.
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.