Moore and Russell's character bound for balanced Young diagrams
Statement
Let . A Young diagram with boxes has at most rows and columns, and let be a permutation. Moore and Russell's character bound. There exists a constant such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.