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

Jones多项式跨度上界的几何刻划

A geometric characterization of the upper bound for the span of the Jones polynomial

J. González-Meneses, P. M. G. Manchón

摘要:

设D是n个交叉点的链路图,s_A和s_B是其极值状态,|s_AD|(分别为. |s_BD|)当根据s_A平滑D时出现的简单闭曲线的数量(分别为s_B)。本文给出了k-几乎交错图D的和|s_AD| + |s_BD|的一般公式,对任意的k,将这个和刻画为一个有边界的适当曲面的适当三角剖分中的面数.当D是去交机连接时,三角剖分特别简单,产生|s_AD| + |s_BD| =n+2-2k。这给出了一个简单的几何证明的跨度的琼斯多项式的上界的dealter连接图,结果首先得到的朱在1997年。作为推论,得到了Adams等人在1992年首次发现的去极连通图和去极简化图的Jones多项式的跨度的另一个上界。作为一个新的应用,我们证明了Turaev亏格等于任何除极连通图的除极交叉数k。

英文摘要:

Let D be a link diagram with n crossings, s_A and s_B its extreme states and |s_AD| (resp. |s_BD|) the number of simple closed curves that appear when smoothing D according to s_A (resp. s_B). We give a general formula for the sum |s_AD|+|s_BD| for a k-almost alternating diagram D, for any k, characterising this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |s_AD|+|s_BD|=n+2-2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu in 1997. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al in 1992, is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram.

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

↑