arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.10356math.GTmath.SG
收藏

A-多项式、Ptolemy 方程与 Dehn 填充

A-polynomials, Ptolemy equations and Dehn filling

Joshua A. Howie, Daniel V. Mathews, Jessica S. Purcell

AI总结:

本文利用 Neumann-Zagier 矩阵的辛性质简化三角剖分计算,证明 Dehn 填充流形族的 A-多项式定义方程可化为 Ptolemy 方程,即尖点环面簇代数中的簇变量方程。

摘要:

A-多项式编码了纽结及相关流形的双曲几何信息。历史上,它一直难以计算,尤其难以确定无限纽结族的 A-多项式。本文中,我们通过从流形的三角剖分出发,利用编码粘合信息的 Neumann-Zagier 矩阵的辛性质来改变计算基底,从而计算 A-多项式。其结果是定义方程得到简化。我们将此方法应用于通过 Dehn 填充得到的流形族,并证明其 A-多项式的定义方程是 Ptolemy 方程,这些方程在符号意义上是尖点环面簇代数中簇变量之间的方程。

英文摘要:

The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute A-polynomials by starting with a triangulation of a manifold, then using symplectic properties of the Neumann-Zagier matrix encoding the gluings to change the basis of the computation. The result is a simplification of the defining equations. We apply this method to families of manifolds obtained by Dehn filling, and show that the defining equations of their A-polynomials are Ptolemy equations which, up to signs, are equations between cluster variables in the cluster algebra of the cusp torus.

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

↑