
























Abstract: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.
From: Dan Margalit [view email]
[v1]
Wed, 14 Aug 2024 14:51:18 UTC (90 KB)
[v2]
Wed, 22 Jan 2025 16:48:56 UTC (102 KB)
[v3]
Fri, 29 May 2026 13:13:30 UTC (104 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。