Search arXivSearch

arXiv · 2404.11293

Statistical convex-cocompactness for mapping class groups of non-orientable surfaces

Abstract

We show that a finite volume deformation retract $\mathcal{T}_{\varepsilon_t}^{-}(\mathcal{N}_g)/\mathrm{MCG}(\mathcal{N}_g)$ of the moduli space $\mathcal{M}(\mathcal{N}_g)$ of non-orientable surfaces $\mathcal{N}_g$ behaves like the convex core of $\mathcal{M}(\mathcal{N}_g)$, despite not even being quasi-convex. We then show that geodesics in the convex core leave compact regions with exponentially low probabilities, showing that the action of $\mathrm{MCG}(\mathcal{N}_g)$ on $\mathcal{T}_{\varepsilon_t}^{-}(\mathcal{N}_g)$ is statistically convex-cocompact. Combined with results of Coulon and Yang, this shows that the growth rate of orbit points under the mapping class group action is purely exponential, pseudo-Anosov elements in mapping class groups of non-orientable surfaces are exponentially generic, and the action of mapping class group on the limit set in the horofunction boundary is ergodic with respect to the Patterson-Sullivan measure. A key step of our proof relies on complexity length, developed by Dowdall and Masur, which is an alternative notion of distance on Teichmüller space that accounts for geodesics that spend a considerable fraction of their time in the thin part.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sayantan Khan. 2024-04-17. Statistical convex-cocompactness for mapping class groups of non-orientable surfaces. https://arxiv.org/abs/2404.11293

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