SearcharxivSearch

arXiv · 2203.12250

Local Statistics of Random Permutations from Free Products

Abstract

Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average? The current paper studies questions of this kind and relates them to surprising topological and algebraic invariants of elements in free products of groups. Formally, let $\Gamma=G_{1}*\ldots*G_{k}$ be a free product of groups where each of $G_1,\ldots,G_k$ is either finite, finitely generated free, or an orientable hyperbolic surface group. For a fixed element $\gamma\in\Gamma$, a $\gamma$-random permutation in the symmetric group $S_{N}$ is the image of $\gamma$ through a uniformly random homomorphism $\Gamma\to S_{N}$. In this paper we study local statistics of $\gamma$-random permutations and their asymptotics as $N$ grows. We first consider $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$, the expected number of fixed points in a $\gamma$-random permutation in $S_{N}$. We show that unless $\gamma$ has finite order, the limit of $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ as $N\to\infty$ is an integer, and is equal to the number of subgroups $H\le\Gamma$ containing $\gamma$ such that $H\cong\mathbb{Z}$ or $H\cong C_{2}*C_{2}$. Equivalently, this is the number of subgroups $H\le\Gamma$ containing $\gamma$ and having (rational) Euler characteristic zero. We also prove there is an asymptotic expansion for $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ and determine the limit distribution of the number of fixed points as $N\to\infty$. These results are then generalized to all statistics of cycles of fixed lengths.

Explore related subjects

Keep this discovery

BibTeXRIS

Doron Puder, Tomer Zimhoni. 2022-03-23. Local Statistics of Random Permutations from Free Products. https://arxiv.org/abs/2203.12250

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