ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group. An irreducible representation (irrep) λ\lambda of SnS_n has dimension dλd_\lambda and character χλ\chi_\lambda. For a permutation π∈Sn\pi\in S_n, let s(π)s(\pi) be its support, let c(π)c(\pi) be the number of its nontrivial cycles, and let t(π)=s(π)−c(π)t(\pi)=s(\pi)-c(\pi) be the minimum number of transpositions whose product is π\pi. Call λ\lambda big if

dλ>e−nlog⁡nn!.d_\lambda>e^{-\sqrt{n}\log n}\sqrt{n!}.

Character bound conjecture. There is a constant AA such that, for sufficiently large nn, every big λ\lambda satisfies

∣χλ(π)dλ∣≤At(π)n−t(π)/2\left|\frac{\chi_\lambda(\pi)}{d_\lambda}\right|\le A^{t(\pi)}n^{-t(\pi)/2}

for all π∈Sn\pi\in S_n.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.