Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle

被引：0
|
作者：
Joel Hass
Tahl Nowik
机构：
[1] University of California,Department of Mathematics
[2] Bar-Ilan University,Department of Mathematics
来源：
Discrete & Computational Geometry | 2010年 / 44卷
关键词：
Reidemister moves; Unknot;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type for which the minimum number of Reidemeister moves required to pass to E is quadratic with respect to the number of crossings. These bounds apply both in S2 and in ℝ2.
引用
收藏
页码：91 / 95
页数：4
相关论文
共 20 条
12