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

伪Anosov映射类的二次时间计算

Quadratic-time computations for pseudo-Anosov mapping classes

Dan Margalit, Balázs Strenner, Samuel J. Taylor, S. Öykü Yurttaş

AI总结:

提出一种二次时间算法,通过输入映射类群中表示伪Anosov映射类的单词,计算其拉伸因子和不变测度叶状结构。

摘要:

我们给出一个二次时间算法,用于计算映射类群中伪Anosov元素的拉伸因子和不变测度叶状结构。算法接受一个单词(在映射类群的任意给定有限生成集中)作为输入,该单词表示一个伪Anosov映射类,单词长度作为输入复杂度的度量。输出是一个列车轨道和一个整数矩阵,其中拉伸因子是最大的实特征值,不稳定叶状结构由对应的特征向量给出。这是第一个已知在次指数时间内终止的计算拉伸因子和测度叶状结构的算法。

英文摘要:

We give a quadratic-time algorithm to compute the stretch factor and the invariant measured foliations for a pseudo-Anosov element of the mapping class group. As input, the algorithm accepts a word (in any given finite generating set for the mapping class group) representing a pseudo-Anosov mapping class, and the length of the word is our measure of complexity for the input. The output is a train track and an integer matrix where the stretch factor is the largest real eigenvalue and the unstable foliation is given by the corresponding eigenvector. This is the first algorithm to compute stretch factors and measured foliations that is known to terminate in sub-exponential time.

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

↑