Journal article
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. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar theorem for split links, which provides a polynomial upper bound on the number of Reidemeister moves required to transform a diagram of the link into a disconnected diagram.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 638.3KB, Terms of use)
-
- Publisher copy:
- 10.4007/annals.2015.182.2.3
Authors
- Publisher:
- Princeton University, Department of Mathematics
- Journal:
- Annals of Mathematics More from this journal
- Volume:
- 182
- Issue:
- 2
- Pages:
- 491-564
- Publication date:
- 2015-09-01
- DOI:
- ISSN:
-
0003-486X
- Keywords:
- Pubs id:
-
pubs:384391
- UUID:
-
uuid:ec086aa0-037b-48b5-abfe-e25ed7ef1b71
- Local pid:
-
pubs:384391
- Source identifiers:
-
384391
- Deposit date:
-
2013-11-16
- ARK identifier:
Terms of use
- Copyright holder:
- Department of Mathematics, Princeton University
- Copyright date:
- 2015
- Notes:
- Copyright © 2015 Department of Mathematics, Princeton University.
If you are the owner of this record, you can report an update to it here: Report update to this record