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

一种计算有色琼斯多项式的有效算法

An Efficient Algorithm to Compute the Colored Jones Polynomial

Mustafa Hajij, Jesse Levitt

摘要:

有色琼斯多项式是一个纽结不变量,在低维拓扑中起着核心作用。本文给出了一个简单而有效的算法来计算任意纽结的色琼斯多项式。我们的算法利用了沿辫子模型的有色琼斯多项式,是由阿蒙德从Huynh和黎的工作改进的散步。行走模型在$q$ -Weyl代数中产生了有序词,我们从多个角度对其进行了讨论和研究。我们提供了一个高度优化的Mathematica实现,利用软件的现代功能。我们包括我们的算法的运行时间的性能分析。我们的算法的实现表明,我们的方法通常运行在更快的时间比现有的国家的最先进的方法由一个数量级。

英文摘要:

The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along a braid model of the colored Jones polynomial that was refined by Armond from the work of Huynh and Lê. The walk model gives rise to ordered words in a $q$-Weyl algebra which we address and study from multiple perspectives. We provide a highly optimized Mathematica implementation that exploits the modern features of the software. We include a performance analysis for the running time of our algorithm. Our implementation of the algorithm shows that our method usually runs in faster time than the existing state-of the-art method by an order of magnitude.

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

↑