Arc-presentations of links. Monotonic simplification
classification
🧮 math.GT
keywords
linksmonotonicsimplificationunknotadmitsalgorithmarc-presentationarc-presentations
read the original 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.
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.