低维拓扑算法
Algorithms for Low-Dimensional Topology
摘要:
在这篇文章中,我们重新介绍了所谓的“Arkaden-Faden-Lage”(简称AFL)表示的结在3维空间介绍了库尔特Reidemeister,并显示它如何可以用来开发有效的算法来计算一些重要的拓扑结结构。特别地,我们介绍了V. Vassiliev提出的一种有效的算法来计算节点的完整表示,并给出了如何利用节点的AFL表示来计算Kontsevich积分的主要思想。这里介绍的方法是我们的知识新颖,可以打开新的视角,在低维拓扑结构的快速算法的发展。
英文摘要:
In this article, we re-introduce the so called "Arkaden-Faden-Lage" (AFL for short) representation of knots in 3 dimensional space introduced by Kurt Reidemeister and show how it can be used to develop efficient algorithms to compute some important topological knot structures. In particular, we introduce an efficient algorithm to calculate holonomic representation of knots introduced by V. Vassiliev and give the main ideas how to use the AFL representations of knots to compute the Kontsevich Integral. The methods introduced here are to our knowledge novel and can open new perspectives in the development of fast algorithms in low dimensional topology.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。