Complexity of planar and spherical curves

Simple item page
dc.creatorNowik, Tahl
dc.date2008-02-21
dc.date.accessioned2026-07-07T09:22:16Z
dc.date.available2026-07-07T09:22:16Z
dc.descriptionWe show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n+2 crossings.
dc.identifierhttps://arxiv.org/abs/0802.3021
dc.identifierhttp://arxiv.org/abs/0802.3021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155320
dc.subjectGeometric Topology
dc.titleComplexity of planar and spherical curves
dc.typetext

Files

Collections

arXiv