Papers
Topics
Authors
Recent
2000 character limit reached

Irregular smoothing and the number of Reidemeister moves (1103.5173v1)

Published 26 Mar 2011 in math.GT

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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.