Sciweavers

DCG
2010
101views more  DCG 2010»
13 years 10 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 ...
Joel Hass, Tahl Nowik