Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
- Author(s): Hass, Joel
- Nowik, Tahl
- et al.
Published Web Locationhttps://doi.org/10.1007/s00454-009-9156-4
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 S 2 and in ℝ2.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.