Complexity of planar and spherical curves
classification
🧮 math.GT
keywords
curvescrossingsplanarsphericalalongcomplexitydonefurthermore
read the original abstract
We 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.