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

曲线复形中高效测地线的超高效性

Super efficiency of efficient geodesics in the complex of curves

Xifeng Jin, William W. Menasco

AI总结:

本文证明曲线复形中高效测地线具有“超高效性”,即顶点候选列表的界独立于距离且仅依赖于亏格,其证明依赖于新的相交增长不等式与点图分析。

摘要:

我们证明高效测地线具有“超高效性”这一强性质。对于亏格为 $g \geq 2$ 的闭可定向曲面的曲线复形 $\mathcal{C}(S_g)$ 中的任意两个顶点 $v, w \in \mathcal{C}(S_g)$,以及任意高效测地线 $v = v_1, \cdots, v_{\text d}=w$,Birman、Margalit 及第二作者(见 arXiv:1408.4133)此前已证明,对于 $v_1$ 顶点存在一个至多包含 ${\text d}^{(6g-6)}$ 个候选者的可显式计算列表。在本文中,我们为该可计算列表建立了一个独立于 ${\text d}$-距离且仅依赖于亏格的界——即超高效性。该证明依赖于曲线交点数与其在曲线复形中距离之间的一个新的相交增长不等式,以及对与相交序列相关联的点图的详尽分析。

英文摘要:

We show that efficient geodesics have the strong property of "super efficiency". For any two vertices, $v , w \in \mathcal{C}(S_g)$, in the complex of curves of a closed oriented surface of genus $g \geq 2 $, and any efficient geodesic, $v = v_1 , \cdots , v_{\text d}=w$, it was previously established by Birman, Margalit and the second author (see arXiv:1408.4133) that there is an explicitly computable list of at most ${\text d}^{(6g-6)}$ candidates for the $v_1$ vertex. In this note we establish a bound for this computable list that is independent of ${\text d}$-distance and only dependent on genus -- the super efficiency property. The proof relies on a new intersection growth inequality between intersection number of curves and their distance in the complex of curves, together with a thorough analysis of the dot graph associated with the intersection sequence.

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

↑