图链理论导论
Introduction to Graph-Link Theory
摘要:
本文介绍了一种组合理论,它是经典和虚拟纽结理论的自然概括。有一种方法可以通过一类“可实现”的图来编码链接。当传递到具有相同等价关系的通用图时,我们得到“图链接”。一方面,图链接概括了虚拟链接的概念,另一方面,他们不觉得链接突变。我们定义了图链接的琼斯多项式,并证明了它的不变性。我们还证明了Kauffman-Murasugi-Thistlethwaite定理关于图链的极小图的推广
英文摘要:
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with the same equivalence relations we get `graph-links'. On one hand graph-links generalise the notion of virtual link, on the other hand they do not feel link mutations. We define the Jones polynomial for graph-links and prove its invariance. We also prove some a generalisation of the Kauffman-Murasugi-Thistlethwaite theorem on `minmal diagrams' for graph-links
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。