Comparing Teichm\"uller and curve graph translation lengths
Philipp Bader

TL;DR
This paper compares translation lengths of pseudo-Anosov mapping classes on Teichmüller space and the curve graph, revealing different asymptotic behaviors and constructing sequences with specific translation length properties.
Contribution
It demonstrates that minimal stable curve graph translation lengths can decrease with genus, contrasting with Teichmüller translation lengths, and constructs sequences with infinite multiplicity of certain lengths.
Findings
Teichmüller translation length is bounded below by log(√2).
Curve graph translation length can be of order 1/g.
Existence of infinitely many pseudo-Anosovs with the same curve graph translation length.
Abstract
A pseudo-Anosov mapping class acts on Teichm\"uller space as well as on the curve graph with so called north-south dynamics. We can measure a stable translation length and of the respective actions. Boissy and Lanneau compute the minimal Teichm\"uller translation length over all pseudo Anosovs in a fixed genus that lie in a hyperelliptic component of translation surfaces. In particular, this minimum is always greater than independently of the genus. Here, we show that the minimal stable curve graph translation length over the same family of pseudo-Anosovs behaves differently: Namely, for a genus surface this minimal translation length is of order To prove this result, we combine techniques that are used to find upper and lower bounds for the stable curve graph translation length with the…
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
TopicsComputational Geometry and Mesh Generation · Natural Language Processing Techniques · Data Management and Algorithms
