Sciweavers

9
Voted
DCG
2010

Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle

13 years 2 months ago
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with respect to the number of crossings. These bounds apply both in S2 and in R2 .
Joel Hass, Tahl Nowik
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where DCG
Authors Joel Hass, Tahl Nowik
Comments (0)