Pseudo-Anosovs optimizing the ratio of Teichm\"uller to curve graph translation length
Tarik Aougab, Samuel J. Taylor

TL;DR
This paper introduces new constructions of pseudo-Anosov maps that optimize the ratio of translation lengths in Teichmüller space and the curve graph, showing their abundance and presence in deep subgroups.
Contribution
The paper presents a novel method for constructing ratio-optimizing pseudo-Anosov maps and proves their widespread existence within the mapping class group.
Findings
Constructed new ratio-optimizing pseudo-Anosov maps
Demonstrated abundance of these maps in the mapping class group
Found such maps deep in the Johnson filtration and in the point pushing subgroup
Abstract
Given a pseudo-Anosov map, let denote the translation length of in the Teichm\"uller space, and let denote the stable translation length of in the curve graph. Gadre--Hironaka--Kent--Leininger showed that, as a function of Euler characteristic , the minimal possible ratio is , up to uniform additive and multiplicative constants. In this short note, we introduce a new construction of such ratio optimizers and demonstrate their abundance in the mapping class group. Further, we show that ratio optimizers can be found arbitrarily deep into the Johnson filtration as well as in the point pushing subgroup.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Geometric and Algebraic Topology · Topological and Geometric Data Analysis
