Quadratic-time computations for pseudo-anosov mapping classes
Forum of Mathematics, Sigma · 2026 · 14
DOI: 10.1017/fms.2026.10255 ↗Kurz gefasst
Fachartikel in der Zeitschrift Forum of Mathematics, Sigma, online erschienen am 29.07.2026. Verfasst von Dan Margalit und 3 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, Fulbright Program.
Abstract (Originalsprache)
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 subexponential time.
Förderung
- National Science Foundation
- Fulbright Program
Zitieren
APA
Margalit, D., Strenner, B., Taylor, S. J., & Yurttaş, S. Ö. (2026). Quadratic-time computations for pseudo-anosov mapping classes. Forum of Mathematics, Sigma, 14. https://doi.org/10.1017/fms.2026.10255
Vancouver
Margalit D, Strenner B, Taylor SJ, Yurttaş SÖ. Quadratic-time computations for pseudo-anosov mapping classes. Forum of Mathematics, Sigma. 2026;14. doi:10.1017/fms.2026.10255
BibTeX
@article{Margalit2026,
author = {Margalit, Dan and Strenner, Balázs and Taylor, Samuel J. and Yurttaş, S. Öykü},
title = {Quadratic-time computations for pseudo-anosov mapping classes},
journal = {Forum of Mathematics, Sigma},
year = {2026},
volume = {14},
doi = {10.1017/fms.2026.10255}
}
EUVIMED