Answers are grounded in this paper and cite their sources.
Fix a word w in a free group F on r generators. A w-random permutation in the symmetric group SN is obtained by sampling r independent uniformly random permutations σ ₁,… ,σ ᵣ∈ SN and evaluating w (σ ₁,… ,σ ᵣ ). In [39, 40], it was shown that the average number of fixed points in a w-random permutation is 1+θ (N1-π (w ) ), where π (w ) is the smallest rank of a subgroup H≤ F containing w as a non-primitive element. We show that π (w ) plays a role in estimates of all stable characters of symmetric groups. In particular, we show that for all t≥ 2, the average number of t-cycles is 1/t+O (N-π (w ) ). As an application, we prove that for every s, every ε>0 and every large enough r, Schreier graphs with r random generators depicting the action of SN on s-tuples, have 2nd eigenvalue at most 2√2r-1+ε asymptotically almost surely. An important ingredient in this work is a systematic study of not necessarily connected Stallings core graphs.
No takes yet. Share an insight, caveat, or question.
Hanany et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: