An Algorithm to Find Ribbon Disks for Alternating Knots

An Algorithm to Find Ribbon Disks for Alternating Knots
复制标题

寻找交替结带盘的算法

DOI:
10.1080/10586458.2022.2158968
复制
发表时间:
2023
影响因子:
0.5
通讯作者:
Owens B
Owens B
中科院分区:
数学3区
文献类型:
--
作者:
Owens B

文献摘要

参考文献

被引文献

相似文献

我们描述了一种寻找交替结的带状盘的算法,以及该算法的计算机实现的结果。该算法的基础是来自唐纳森对角化定理的切片链接障碍。它成功地找到了切片两桥结的带状盘,以及任何交替结与其反向镜的连接和,以及 21 个或更少交叉的 662,903 个素数交替结。我们还识别了一些带状交替结的示例,尽管相关搜索识别了所有已知的此类示例,但算法无法找到带状盘。将这些搜索与已知障碍物相结合,我们解决了超过 12 亿个具有 21 个或更少交叉的素数交替结中除 3276 个之外的所有切片的问题。
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 diagonalization 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 3276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.
Khovanov 同源性和切片属
DOI: --
发表时间: 2004
期刊:
影响因子: --
作者:
J. Rasmussen
通讯作者: J. Rasmussen
透镜空间、有理球和丝带猜想
DOI: 10.2140/gt.2007.11.429
发表时间: 2007
影响因子: 2
作者:
P. Lisca
通讯作者: P. Lisca
DOI: 10.1007/bf01188642
发表时间: 1933
影响因子: 0.8
作者:
Lebrecht Goeritz
通讯作者: Lebrecht Goeritz
有理球边界的透镜空间之和
DOI: 10.2140/agt.2007.7.2141
发表时间: 2007
影响因子: 0.7
作者:
P. Lisca
通讯作者: P. Lisca
DOI: 10.2140/agt.2012.12.2069
发表时间: 2012
影响因子: 0.7
作者:
Donald A
通讯作者: Donald A