An upper bound on Reidemeister moves
From MaRDI portal
Publication:2879440
DOI10.1353/ajm.2014.0027zbMath1301.57004arXiv1104.1882OpenAlexW2017331367WikidataQ56474487 ScholiaQ56474487MaRDI QIDQ2879440
Marc Lackenby, Alexander Coward
Publication date: 1 September 2014
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1882
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
Rectangular knot diagrams classification with deep learning ⋮ Models of random knots ⋮ The Reidemeister graph is a complete knot invariant ⋮ When can a link be obtained from another using crossing exchanges and smoothings? ⋮ Untangling planar curves ⋮ The computational complexity of knot genus in a fixed 3‐manifold ⋮ Traversing three-manifold triangulations and spines ⋮ Diagrammatic state sums for 2D pin-minus TQFTs ⋮ Knots, Diagrams and Kids’ Shoelaces. On Space and their Forms ⋮ Link crossing number is NP-hard ⋮ A polynomial upper bound on Reidemeister moves ⋮ Two-dimensional state sum models and spin structures ⋮ NP–hard problems naturally arising in knot theory ⋮ On the complexity of torus knot recognition ⋮ Bounds on Pachner moves and systoles of cusped 3-manifolds ⋮ Visual Algebraic Proofs for Unknot Detection
This page was built for publication: An upper bound on Reidemeister moves