Search arXivSearch

arXiv · 2504.08988

Strong convergence of uniformly random permutation representations of surface groups

Abstract

Let $Γ$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(Γ,S_n)$ with the $(n-1)$-dimensional irreducible representation of $S_n$. We prove the strong convergence in probability as $n\to\infty$ of this sequence of random representations to the regular representation of $Γ$. As a consequence, for any closed hyperbolic surface $X$, with probability tending to one as $n\to\infty$, a uniformly random degree-$n$ covering space of $X$ has near optimal relative spectral gap -- ignoring the eigenvalues that arise from the base surface $X$. To do so, we show that the polynomial method of proving strong convergence can be extended beyond rational settings. To meet the requirements of this extension we prove two new kinds of results. First, we show there are effective polynomial approximations of expected values of traces of elements of $Γ$ under random homomorphisms to $S_n$. Secondly, we estimate the growth rates of probabilities that a finitely supported random walk on $Γ$ is a proper power after a given number of steps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Magee, Doron Puder, Ramon van Handel. 2025-04-29. Strong convergence of uniformly random permutation representations of surface groups. https://arxiv.org/abs/2504.08988

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