arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0812.1382math.GT
收藏

使用巨型台阶建造纽结隧道

Constructing knot tunnels using giant steps

Sangbum Cho, Darryl McCullough

摘要:

这是三篇论文中的第一篇,它们完善和扩展了我们早期预印本的部分内容,“结隧道的深度”。“他们一起重新制作了整个预印本。H. Goda,M. Scharlemann和A.汤普森描述了使用“隧道移动”的所有隧道1号节的所有隧道的一般构造。我们应用我们在“节点隧道树”中介绍的理论来研究这种结构。特别是,我们用它来计算不同的最小序列的隧道移动,可以产生一个给定的隧道。因此,我们看到,对于稀疏的无限集隧道,最小序列是唯一的,但一般来说,隧道将有许多这样的结构。

英文摘要:

This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all tunnels of all tunnel number 1 knots using "tunnel moves". We apply the theory that we introduced in "The tree of knot tunnels" to study this construction. In particular, we use it to calculate the number of distinct minimal sequences of tunnel moves that can produce a given tunnel. As a consequence, we see that for a sparse infinite set of tunnels, the minimal sequence is unique, but generically a tunnel will have many such constructions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑