Sharp character bounds and cutoff for symmetric groups
Representation Theory
2025-08-05 v2 Combinatorics
Group Theory
Probability
Abstract
We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character bound with optimal constant . We furthermore prove sharp character bounds for conjugacy classes having a macroscopic number of fixed points, and deduce that the random walks on the associated Cayley graphs exhibit a total variation and cutoff.
Cite
@article{arxiv.2503.12735,
title = {Sharp character bounds and cutoff for symmetric groups},
author = {Sam Olesker-Taylor and Lucas Teyssier and Paul Thévenin},
journal= {arXiv preprint arXiv:2503.12735},
year = {2025}
}
Comments
v2: 40 pages. Change in title. The exposition and proofs were improved. The application to cutoff profiles was moved to a follow up paper. v1: 65 pages, comments welcome!