SearcharxivSearch

arXiv · 2310.18637

Asymptotic independence for random permutations from surface groups

Abstract

Let $X$ be an orientable hyperbolic surface of genus $g\geq 2$ with a marked point $o$, and let $\Gamma$ be an orientable hyperbolic surface group isomorphic to $\pi_{1}(X,o)$. Consider the space $\text{Hom}(\Gamma,S_{n})$ which corresponds to $n$-sheeted covers of $X$ with labeled fiber. Given $\gamma\in\Gamma$ and a uniformly random $\phi\in\text{Hom}(\Gamma,S_{n})$, what is the expected number of fixed points of $\phi(\gamma)$? Formally, let $F_{n}(\gamma)$ denote the number of fixed points of $\phi(\gamma)$ for a uniformly random $\phi\in\text{Hom}(\Gamma,S_{n})$. We think of $F_{n}(\gamma)$ as a random variable on the space $\text{Hom}(\Gamma,S_{n})$. We show that an arbitrary fixed number of products of the variables $F_{n}(\gamma)$ are asymptotically independent as $n\to\infty$ when there are no obvious obstructions. We also determine the limiting distribution of such products. Additionally, we examine short cycle statistics in random permutations of the form $\phi(\gamma)$ for a uniformly random $\phi\in\text{Hom}(\Gamma,S_{n})$. We show a similar asymptotic independence result and determine the limiting distribution.

Explore related subjects

Keep this discovery

BibTeXRIS

Yotam Maoz. 2023-10-28. Asymptotic independence for random permutations from surface groups. https://arxiv.org/abs/2310.18637

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR