Skip to main content
Download PDF
- Main
Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle
Published Web Location
https://doi.org/10.1007/s00454-009-9156-4Abstract
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's open access policies. Let us know how this access is important for you.