A polynomial upper bound on Reidemeister moves

Abstract

We prove that any diagram of the unknot with $c$ crossings may be reduced to the trivial diagram using at most $(236 \,c)^{11}$ Reidemeister moves.

Authors

Marc Lackenby

Mathematical Institute, University of Oxford, Oxford, UK