The character bound conjecture for high-dimensional irreducible representations of symmetric groups
Statement
Let be the symmetric group. An irreducible representation (irrep) of has dimension and character . For a permutation , let be its support, let be the number of its nontrivial cycles, and let be the minimum number of transpositions whose product is . Call big if
Character bound conjecture. There is a constant such that, for sufficiently large , every big satisfies
for all .
This conjectured uniform estimate for normalized characters of sufficiently high-dimensional irreducible representations would imply the required smoothness bounds for typical representations and support the analysis of quantum sieve algorithms for Graph Isomorphism. Its status is not resolved in the supplied source.
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.