arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0211346math.GTmath.CO
收藏

枚举素数交替结,第I部分

Enumerating the Prime Alternating Knots, Part I

Ortho Smith, John Schermann, Stuart Rankin

摘要:

这是第一次在一系列的四个文件,其中我们列举了所有总理交替结和链接。在这第一篇论文中,我们介绍了四个运营商的结,并表明,当使用根据非常简单的规则的总理交替结的n个交叉,一套所有总理交替结的n+1交叉。第二篇论文(第二部分)解释了如何以有效的方式实际实现运营商,虽然这在某种意义上是次要的引进一个完整的不变量的总理交替结,所谓的主阵列的总理交替结。第三篇论文建立了一个方法来枚举的总理交替环节。它示出,一个可以选择任何总理交替链接图的给定的最小交叉大小和应用程序的两个运营商(即T和OTS)选择的种子链接,一个获得所需的最小交叉大小的所有总理交替链接图。第四篇文章介绍了素交错环主阵列的模拟。

英文摘要:

This is the first in a series of four papers wherein we enumerate all prime alternating knots and links. In this first paper, we introduce four operators on knots and show that, when used according to very simple rules on the prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. The second paper (Part II) explains how to actually implement the operators in an efficient manner, although that is in a sense secondary to introduction of a complete invariant for prime alternating knots, called the master array of a prime alternating knot. The third paper in the series establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link diagram of a given minimal crossing size and by applications of just two operators (namely T and OTS) to the selected seed link, one obtains all prime alternating link diagrams of the desired minimal crossing size. The fourth paper introduces the analogue of the master array for prime alternating links.

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

↑