Invariants of Knot Diagrams

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.

References in corpus (1)

• Every Reidemeister move is needed for each knot type

Cited by in corpus (1)

• Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle