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

交替链环等价性的多项式算法

Polynomial algorithm for alternating link equivalence

Touseef Haider, Anastasiia Tsvietkova

AI总结:

本文研究两个交替链环图的同痕等价判定,结合 Tait flyping 猜想及图论复杂度结果,给出以最大交叉点数计的多项式时间算法。

摘要:

三维空间中链环在同痕意义下的等价性问题是纽结理论的根本问题,在三维拓扑学与几何学中具有重要意义。我们考察该问题在交替链环上的限制:给定分别具有 $n_1$ 和 $n_2$ 个交叉点的两个交替图,证明该问题存在一个以 $\max\{n_1,n_2\}$ 计的多项式算法。证明中使用了 Tait flyping 猜想、源于 Lackenby、Menasco、Sundberg 和 Thistlethwaite 关于交替链环工作的观察,以及图论和拓扑图论中若干问题的算法复杂度。

英文摘要:

Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams with $n_1$ and $n_2$ crossings, and show that this problem has polynomial algorithm in terms of $max\{n_1, n_2\}$. For the proof, we use Tait flyping conjectures, observations stemming from the work of Lackenby, Menasco, Sundberg and Thistlethwaite on alternating links, and algorithmic complexity of some problems from graph theory and topological graph theory.

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

↑