arXiv · math/0208153
Arc-presentations of links. Monotonic simplification
Abstract
We prove that any arc-presentation of the unknot admits a monotonic simplification by elementary moves; this yields a simple algorithm for recognizing the unknot. We obtain similar results for split links and composite links.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ivan Dynnikov. 2004-07-16. Arc-presentations of links. Monotonic simplification. https://arxiv.org/abs/math/0208153
Cite the original work for its findings. Save a collection to share your selection of sources.