arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0211348math.GTmath.CO
收藏

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

Enumerating the Prime Alternating Knots, Part II

Ortho Smith, John Schermann, Stuart Rankin

摘要:

这是第二部分系列致力于枚举总理交替结和链接。在第一部分中,我们引入了四个纽结算子,并证明了如果将这些算子应用于n个交叉的所有素数交错纽结的集合,则得到n+1个交叉的所有素数交错纽结的集合。在本文中,我们将解释如何以有效的方式实际实现操作符。这依赖于我们已经引入的一个完整的不变量,称为素数交替结的主数组。到1999年12月1日,我们已经在UWO Compaq ES-40 48节点beowulf集群上成功地运行了第二部分中描述的算法的早期实现,以产生19个交叉点的40,619,385个素数交替结。在那个时候,我们没有非常有效地利用内存,我们无法继续下去,因为在这些水平上,每增加一个交叉大小,素数交替结的数量就增加大约5倍。我们随后在内存利用率和必须完成的工作量方面都做了很大的改进。

英文摘要:

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. In this paper, we explain how to actually implement the operators in an efficient manner. This relies on a complete invariant that we have introduced, called the master array for a prime alternating knot. By December 1, 1999, we had successfully run an early implementation of the algorithms described in Part II on the UWO Compaq ES-40 48 node beowulf cluster to produce the 40,619,385 prime alternating knots of 19 crossings. At that time, we did not utilize memory very efficiently, and we were not able to continue further, since the number of prime alternating knots is increasing roughly by a factor of 5 with each increase in crossing size at these levels. We have subsequently made very big improvements both in memory utilization and in the amount of work that must be done.

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

↑