一种寻找交替结的带状圆盘的算法

IF 0.7 4区数学 Q2 MATHEMATICS

Experimental Mathematics Pub Date : 2021-02-23 DOI:10.1080/10586458.2022.2158968

Brendan Owens, Frank Swenton

{"title":"一种寻找交替结的带状圆盘的算法","authors":"Brendan Owens, Frank Swenton","doi":"10.1080/10586458.2022.2158968","DOIUrl":null,"url":null,"abstract":"We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It successfully finds ribbon disks for slice two-bridge knots and for the connected sum of any alternating knot with its reverse mirror, as well as for 662,903 prime alternating knots of 21 or fewer crossings. We also identify some examples of ribbon alternating knots for which the algorithm fails to find ribbon disks, though a related search identifies all such examples known. Combining these searches with known obstructions, we resolve the sliceness of all but 3,276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Algorithm to Find Ribbon Disks for Alternating Knots\",\"authors\":\"Brendan Owens, Frank Swenton\",\"doi\":\"10.1080/10586458.2022.2158968\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It successfully finds ribbon disks for slice two-bridge knots and for the connected sum of any alternating knot with its reverse mirror, as well as for 662,903 prime alternating knots of 21 or fewer crossings. We also identify some examples of ribbon alternating knots for which the algorithm fails to find ribbon disks, though a related search identifies all such examples known. Combining these searches with known obstructions, we resolve the sliceness of all but 3,276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.\",\"PeriodicalId\":50464,\"journal\":{\"name\":\"Experimental Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2021-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Experimental Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/10586458.2022.2158968\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Experimental Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/10586458.2022.2158968","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 5

摘要

我们描述了一种寻找交替结带盘的算法，以及该算法的计算机实现结果。该算法的基础是来自Donaldson对角化定理的切片链路阻塞。它成功地为切片双桥结和任何交替结与其反向镜像的连接和以及662,903个交叉点小于等于21的素数交替结找到了带盘。我们还确定了一些带状交替结的例子，其中算法无法找到带状磁盘，尽管相关搜索确定了所有已知的此类例子。将这些搜索与已知的障碍物结合起来，我们解决了超过12亿个素数交替结中的3276个，其中21个或更少的交叉点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Algorithm to Find Ribbon Disks for Alternating Knots

We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It successfully finds ribbon disks for slice two-bridge knots and for the connected sum of any alternating knot with its reverse mirror, as well as for 662,903 prime alternating knots of 21 or fewer crossings. We also identify some examples of ribbon alternating knots for which the algorithm fails to find ribbon disks, though a related search identifies all such examples known. Combining these searches with known obstructions, we resolve the sliceness of all but 3,276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Experimental Mathematics 数学-数学

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Experimental Mathematics publishes original papers featuring formal results inspired by experimentation, conjectures suggested by experiments, and data supporting significant hypotheses. Experiment has always been, and increasingly is, an important method of mathematical discovery. (Gauss declared that his way of arriving at mathematical truths was "through systematic experimentation.") Yet this tends to be concealed by the tradition of presenting only elegant, fully developed, and rigorous results. Experimental Mathematics was founded in the belief that theory and experiment feed on each other, and that the mathematical community stands to benefit from a more complete exposure to the experimental process. The early sharing of insights increases the possibility that they will lead to theorems: An interesting conjecture is often formulated by a researcher who lacks the techniques to formalize a proof, while those who have the techniques at their fingertips have been looking elsewhere. Even when the person who had the initial insight goes on to find a proof, a discussion of the heuristic process can be of help, or at least of interest, to other researchers. There is value not only in the discovery itself, but also in the road that leads to it.