首页 | 本学科首页   官方微博 | 高级检索  
     


The number of Reidemeister moves needed for unknotting
Authors:Joel Hass   Jeffrey C. Lagarias
Affiliation:Department of Mathematics, University of California, Davis, California 95616 ; AT&T Labs -- Research, Florham Park, New Jersey 07932
Abstract:

There is a positive constant $c_1$ such that for any diagram $mathcal{D}$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, where $n$ is the number of crossings in $mathcal{D}$. A similar result holds for elementary moves on a polygonal knot $K$ embedded in the 1-skeleton of the interior of a compact, orientable, triangulated $PL$ 3-manifold $M$. There is a positive constant $c_2$ such that for each $t geq 1$, if $M$ consists of $t$ tetrahedra and $K$ is unknotted, then there is a sequence of at most $2^{c_2 t}$ elementary moves in $M$ which transforms $K$ to a triangle contained inside one tetrahedron of $M$. We obtain explicit values for $c_1$ and $c_2$.

Keywords:Knot theory   knot diagram   Reidemeister move   normal surfaces   computational complexity
点击此处可从《Journal of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Journal of the American Mathematical Society》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号