ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C>0C>0. A Young diagram λ\lambda with nn boxes has at most CnC\sqrt{n} rows and columns, and let π∈Sn\pi\in S_n be a permutation. Moore and Russell's character bound. There exists a constant DD such that

∣χλ(π)∣<(Dn)∣π∣.|\chi^{\lambda}(\pi)| < \left(\frac{D}{\sqrt{n}}\right)^{|\pi|}.

This conjectured estimate would bound the multiplicities in Kronecker tensor products of balanced irreducible representations and would imply that the relevant quantum algorithm for graph isomorphism is no faster than the best known classical algorithms. Its resolution is not specified in the 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.