Search arXivSearch

arXiv · 2305.03721

Counting mapping classes by Nielsen-Thurston type

Abstract

This paper concerns the lattice counting problem for the mapping class group of a surface $S$ acting on Teichmüller space with the Teichmüller metric. In that problem the goal is to count the number of mapping classes that send a given point $x$ into the ball of radius $R$ centered about another point $y$. For the action of the entire group, Athreya, Bufetov, Eskin and Mirzakhani have shown this quantity is asymptotic to $e^{hR}$, where $h$ is the dimension of the Teichmüller space. We refine the problem by considering the action various distinguished subsets of elements and counting these separately. For the set of finite-order elements, we show the associated count grows coarsely at the rate of $e^{hR/2}$, that is, with half the exponent. For the reducible elements, the associated count grows coarsely at the rate of $e^{(h-1)R}$. Finally, for the set of all multitwists, the coarse growth rate is also $e^{hR/2}$. To obtain these quantitative estimates, we introduce a new notion in Teichmüller geometry, called complexity length, which reflects some aspects of the negative curvature of curve complexes and also has applications to counting problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spencer Dowdall, Howard Masur. 2026-03-24. Counting mapping classes by Nielsen-Thurston type. https://arxiv.org/abs/2305.03721

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT