arXiv · 2503.12735
Sharp character bounds and cutoff for symmetric groups
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 $1/2$. 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 $L^2$ cutoff.
Explore related subjects
Keep this discovery
Sam Olesker-Taylor, Lucas Teyssier, Paul Thévenin. 2025-03-17. Sharp character bounds and cutoff for symmetric groups. https://arxiv.org/abs/2503.12735
Cite the original work for its findings. Save a collection to share your selection of sources.