Word measures on symmetric groups

From MaRDI portal
Publication:2199879

DOI10.1093/IMRN/RNAC084zbMATH Open1448.20026arXiv2009.00897MaRDI QIDQ2199879FDOQ2199879


Authors: Liam Hanany, Doron Puder Edit this on Wikidata


Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire, IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: 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 sigma1,ldots,sigmarinSN and evaluating wleft(sigma1,ldots,sigmaright). In [arXiv:1104.3991, arXiv:1202.3269] it was shown that the average number of fixed points in a w-random permutation is 1+hetaleft(N1pileft(wight)ight), where pileft(wight) is the smallest rank of a subgroup HleF containing w as a non-primitive element. We show that pileft(wight) plays a role in estimates of all stable characters of symmetric groups. In particular, we show that for all tge2, the average number of t-cycles is frac1t+Oleft(Npileft(wight)ight). As an application, we prove that for every s, every varepsilon>0 and every large enough r, Schreier graphs with r random generators depicting the action of SN on s-tuples, have second eigenvalue at most 2sqrt2r1+varepsilon asymptotically almost surely. An important ingredient in this work is a systematic study of not-necessarily connected Stallings core graphs.


Full work available at URL: https://arxiv.org/abs/2009.00897

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (14)





This page was built for publication: Word measures on symmetric groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199879)