Knots, Reidemeister moves, and algorithms [after Lackenby]

MaRDI QIDQ5067995zbMATH OpenFDO

Authors Arnaud de Mesmay

Publication date 5 April 2022

Full work available at URL https://smf.emath.fr/publications/expose-bourbaki-1121-noeuds-mouvements-de-reidemeister-et-algorithmes-dapres-lackenby

Mathematics Subject Classification ID

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

Recommendations

• Local and algorithmic moves of knots according to Lackenby
• A polynomial upper bound on Reidemeister moves
• On a problem of effective knot theory
• The unbearable hardness of unknotting
• The number of Reidemeister moves needed for unknotting

Cited in

(10)

• On a problem of effective knot theory
• The number of Reidemeister moves needed for unknotting
• Algorithmic simplification of knot diagrams: new moves and experiments
• Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves
• Minimal unknotting sequences of Reidemeister moves containing unmatched RII moves
• Unknotting unknots
• ON THE STRUCTURE OF SIMPLY REPRESENTED KNOTS
• Local and algorithmic moves of knots according to Lackenby
• On the Length of Knot Transformations via Reidemeister Moves I and II
• Arc-presentations of links: Monotonic simplification

This page was built for publication: Knots, Reidemeister moves, and algorithms [after Lackenby]

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