Abstract
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236c)11 Reidemeister moves.
Cite
CITATION STYLE
APA
Lackenby, M. (2015). A polynomial upper bound on Reidemeister moves. Annals of Mathematics, 182(2), 491–564. https://doi.org/10.4007/annals.2015.182.2.3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free