Invariants of Knot Diagrams

2007/08/18 by Joel Hass, Hass, Joel, Tahl Nowik +1
Mathematics · #57M25 #FOS: Mathematics #Geometric Topology (math.GT) #math.GT #msc:57M25

paper · pdf · doi:10.48550/arxiv.0708.2509

arxiv created 2007/08/18 · arxiv updated 2009/12/01

Abstract

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.

Related

• Invariants of knot diagrams and relations among Reidemeister moves
• Every Reidemeister move is needed for each knot type
• Irregular smoothing and the number of Reidemeister moves
• On ordered sequences for link diagrams with respect to Reidemeister moves I and III
• Unknotting number and number of Reidemeister moves needed for unlinking