Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle

Simple item page
dc.creatorHass, Joel
dc.creatorNowik, Tahl
dc.date2007-11-15
dc.date.accessioned2026-07-07T08:43:04Z
dc.date.available2026-07-07T08:43:04Z
dc.descriptionWe present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.
dc.identifierhttps://arxiv.org/abs/0711.2350
dc.identifierhttp://arxiv.org/abs/0711.2350
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142184
dc.subjectGeometric Topology
dc.subject57M25
dc.titleUnknot diagrams requiring a quadratic number of Reidemeister moves to untangle
dc.typetext

Files

Collections

arXiv