An upper bound on Reidemeister moves

2011/04/11 by Coward, Alexander, Lackenby, Marc · 1 citation
#57M25 #57N10 #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1104.1882

Abstract

We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.

Cited by

• Rigidity of highly twisted plat diagrams

Related

• A polynomial upper bound on Reidemeister moves
• Natural Moves for Knots and Links
• On ordered sequences for link diagrams with respect to Reidemeister moves I and III
• On link diagrams that are minimal with respect to Reidemeister moves I and II
• Unknotting number and number of Reidemeister moves needed for unlinking