Complexity of plane and spherical curves
Nowik, Tahl
Duke Math. J., Tome 146 (2009) no. 1, p. 107-118 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show that the maximal number of singular moves required to pass between any two regularly homotopic plane or spherical curves with at most $n$ crossings grows quadratically with respect to $n$ . Furthermore, for any two regularly homotopic curves with at most $n$ crossings, there exists such a sequence of singular moves, satisfying the quadratic bound, for which all curves along the way have at most $n+2$ crossings
Publié le : 2009-05-15
Classification:  57M99 
@article{1240432193,
     author = {Nowik, Tahl},
     title = {Complexity of plane and spherical curves},
     journal = {Duke Math. J.},
     volume = {146},
     number = {1},
     year = {2009},
     pages = { 107-118},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1240432193}
}

Nowik, Tahl. Complexity of plane and spherical curves. Duke Math. J., Tome 146 (2009) no. 1, pp.  107-118. http://gdmltest.u-ga.fr/item/1240432193/