40 citations · 186 across the 33 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
math.GT2007
Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
Joel Hass, Tahl Nowik
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number o…
math.GT2007★ 1 cited
Invariants of Knot Diagrams
Joel Hass, Tahl Nowik
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.