Local and algorithmic moves of knots according to Lackenby

zbMATH Open1408.57004MaRDI QIDQ4557403FDOQ4557403

Authors: Arnaud de Mesmay 

Publication date: 23 November 2018

Recommendations

• Knots, Reidemeister moves, and algorithms [after Lackenby]
• A polynomial upper bound on Reidemeister moves
• The Unknotting Problem
• On a problem of effective knot theory
• Unknotting unknots

zbMATH Keywords

algorithmknotunknottingReidemeister move

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to manifolds and cell complexes (57-02)

Cited In (8)

• Unknotting unknots
• A LOWER BOUND FOR THE NUMBER OF REIDEMEISTER MOVES FOR UNKNOTTING
• Knot insertion algorithms and local linear independence
• Boundary-twisted normal form and the number of elementary moves to unknot
• The number of Reidemeister moves needed for unknotting
• Algorithmic simplification of knot diagrams: new moves and experiments
• Knots, Reidemeister moves, and algorithms [after Lackenby]
• THE PROBLEM OF DETECTING THE SATELLITE STRUCTURE OF A LINK BY MONOTONIC SIMPLIFICATION

This page was built for publication: Local and algorithmic moves of knots according to Lackenby

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557403)