SearcharxivSearch

arXiv · 2305.11285

Word Measures On Wreath Products I

Abstract

Every word $w$ in the free group $F_r$ of rank $r$ induces a probability measure (the $w$-measure) on every compact group $G$, by substitution of Haar-random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $\mathbb{E}_w[\chi]$ of the irreducible characters of $G$. For every compact group $G$, the wreath product with the symmetric group $G\wr S_n$ has some natural irreducible characters $\chi$, and we approximate $\mathbb{E}_w[\chi]$ for every word $w\in F_r$, revealing new automorphism-invariant quantities of words that generalize the primitivity rank $\pi(w)$. This generalizes previous works by Parzanchevsky-Puder and Magee-Puder. We demonstrate applications to automorphism groups of trees, investigate properties of the new invariants, and show polynomial decay of $\mathbb{E}_w[\chi]$ also for wreath products with more general actions.

Explore related subjects

Keep this discovery

BibTeXRIS

Yotam Shomroni. 2023-05-18. Word Measures On Wreath Products I. https://arxiv.org/abs/2305.11285

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