The number of Reidemeister moves needed for unknotting
From MaRDI portal
Publication:2701705
DOI10.1090/S0894-0347-01-00358-7zbMath0964.57005arXivmath/9807012OpenAlexW2167559986MaRDI QIDQ2701705
Jeffrey C. Lagarias, Joel Hass
Publication date: 19 February 2001
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9807012
Related Items
A LOWER BOUND FOR THE NUMBER OF REIDEMEISTER MOVES FOR UNKNOTTING, TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT, Core curves of triangulated solid tori, The unbearable hardness of unknotting, A bound for orderings of Reidemeister moves, Some conditionally hard problems on links and 3-manifolds, A Markov Chain Sampler for Plane Curves, Tait’s conjectures and odd crossing number amphicheiral knots, The computational complexity of knot genus in a fixed 3‐manifold, A distance for diagrams of a knot, Complexity of triangulations of the projective space., Knots, Diagrams and Kids’ Shoelaces. On Space and their Forms, Invariants of knot diagrams, A polynomial upper bound on Reidemeister moves, On ambiguity in knot polynomials for virtual knots, Noncyclic covers of knot complements, Ordering the Reidemeister moves of a classical knot, Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle, The number of Reidemeister moves for splitting a link, Unnamed Item, The efficient certification of knottedness and Thurston norm, The computational complexity of knot genus and spanning area, The size of triangulations supporting a given link, Complexity of plane and spherical curves, The Unknotting Problem, Non-orientable fundamental surfaces in Lens spaces, The crossing number of composite knots, NP–hard problems naturally arising in knot theory, Virtual knots and links
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- Studying links via closed braids. IV: Composite links and split links
- Intersections of curves on surfaces
- Ein Verfahren zur Aufspaltung einer 3-Mannigfaltigkeit in irreduzible 3- Mannigfaltigkeiten
- A new algorithm for recognizing the unknot
- On a problem of effective knot theory
- Algorithms for recognizing knots and 3-manifolds
- Triangulating point sets in space
- PL equivariant surgery and invariant decompositions of 3-manifolds
- Algorithms for the complete decomposition of a closed \(3\)-manifold
- The computational complexity of knot and link problems
- Efficient Planarity Testing
- Knots
