Word Measures on Symmetric Groups
arXiv:2009.00897 · doi:10.1093/imrn/rnac084
Abstract
Fix a word in a free group on generators. A -random permutation in the symmetric group is obtained by sampling independent uniformly random permutations and evaluating . In [arXiv:1104.3991, arXiv:1202.3269] it was shown that the average number of fixed points in a -random permutation is , where is the smallest rank of a subgroup containing as a non-primitive element. We show that plays a role in estimates of all stable characters of symmetric groups. In particular, we show that for all , the average number of -cycles is . As an application, we prove that for every , every and every large enough , Schreier graphs with random generators depicting the action of on -tuples, have second eigenvalue at most asymptotically almost surely. An important ingredient in this work is a systematic study of not-necessarily connected Stallings core graphs.
53 pages, 3 figures. This version: fixed a minor gap in Appendix A
References in corpus (19)
- FI-modules and stability for representations of symmetric groups
- Representation theory and homological stability
- Second Order Freeness and Fluctuations of Random Matrices: II. Unitary Random Matrices
- Expansion of Random Graphs: New Proofs, New Results
- Measure Preserving Words are Primitive
- Eigenvalues of random lifts and polynomials of random permutation matrices
- Combinatorial aspects of Connes's embedding conjecture and asymptotic distribution of traces of products of unitaries
- Primitive Words, Free Factors and Measure Preservation
- Stable commutator length is rational in free groups
- Words Maps and Spectra of Random Graph Lifts
- Matrix Group Integrals, Surfaces, and Mapping Class Groups I:
- Stallings Graphs, Algebraic Extensions and Primitive Elements in F2
- Growth of Primitive Elements in Free Groups
- Some Orbits of Free Words that are Determined by Measures on Finite Groups
- Expansion in simple groups
- On algebraic extensions and decomposition of homomorphisms in free groups
- A Note on the Trace Method for Random Regular Graphs
- Short, highly imprimitive words yield hyperbolic one-relator groups
- Automorphism-invariant positive definite functions on free groups