Irregular smoothing and the number of Reidemeister moves
classification
🧮 math.GT
keywords
diagraminvariantnumbersmoothingirregularlinkmovesreidemeister
read the original abstract
In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link diagram invariant using irregular smoothing, and give an example of a knot diagram of the unknot for which the new invariant gives a better estimation than the old one.
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.