Arc-presentations of links. Monotonic simplification
arXiv:math/0208153
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.
latex, 45 pages, 34 figures; a mistake pointed out by W.Menasco and A.Sikora has been corrected
References in corpus (1)
Cited by in corpus (20)
- Legendrian knots, transverse knots and combinatorial Floer homology
- On combinatorial link Floer homology
- Grid Diagrams, Braids, and Contact Geometry
- A family of transversely nonsimple knots
- Grid diagrams and Manolescu's unoriented skein exact triangle for knot Floer homology
- Heegaard Floer homology of spatial graphs
- Rectangular diagrams of surfaces: representability
- Rectangular diagrams of surfaces: distinguishing Legendrian knots
- Distinguishing Legendrian knots with trivial orientation-preserving symmetry group
- Singular link Floer homology
- Balanced presentations of the trivial group and four-dimensional geometry
- Arc diagrams on 3-manifold spines
- Multiflypes of rectangular diagrams of links
- GridPyM: a Python module to handle grid diagrams
- New presentations of a link and virtual link
- Unknot Recognition Through Quantifier Elimination
- Complexity of Unknotting of Trivial 2-knots
- Transverse-Legendrian links
- Grid diagram for singular links
- Rectangular knot diagrams classification with deep learning