Abstract
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 ℝ2.
Original language | English |
---|---|
Pages (from-to) | 91-95 |
Number of pages | 5 |
Journal | Discrete and Computational Geometry |
Volume | 44 |
Issue number | 1 |
DOIs | |
State | Published - Jul 2010 |
Bibliographical note
Funding Information:The research of J. Hass was supported in part by NSF grant DMS-0306602.
Funding
The research of J. Hass was supported in part by NSF grant DMS-0306602.
Funders | Funder number |
---|---|
National Science Foundation | DMS-0306602 |
Directorate for Mathematical and Physical Sciences | 0306602 |
Keywords
- Reidemister moves
- Unknot