arXiv Analytics

Sign in

arXiv:0708.2509 [math.GT]AbstractReferencesReviewsResources

Invariants of Knot Diagrams

Joel Hass, Tahl Nowik

Published 2007-08-18Version 1

We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.

Categories: math.GT
Subjects: 57M25
Related articles: Most relevant | Search more
arXiv:math/9807012 [math.GT] (Published 1998-07-02)
The number of Reidemeister Moves Needed for Unknotting
arXiv:1507.04088 [math.GT] (Published 2015-07-15)
A lower bound on minimal number of colors for links
arXiv:math/0005108 [math.GT] (Published 2000-05-11)
Invariants of knot diagrams and relations among Reidemeister moves

Links

Toolbox