Hanany–Puder character bound conjecture for word maps on symmetric groups
Statement
Let be the free group of rank . For a word , let
with if no such subgroup exists. For and a partition , let denote the corresponding stable Young diagram, and let and be the associated irreducible character and representation of . For independent uniformly random permutations , write for the word-map evaluation.
Hanany–Puder conjecture. For any , any , and any ,
This conjectures a substantially stronger decay estimate than the known bound for words that are not proper powers or the identity. It refines the study of distributions of word maps on symmetric groups by relating character expectations to the primitivity rank of the word and the dimension of the corresponding stable irreducible representation.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.