The square-root factorial bound for Kronecker multiplicities
Statement
Let be a positive integer, and let be partitions of . The Kronecker multiplicity is the multiplicity of the irreducible character indexed by in the tensor product of the irreducible characters indexed by and . Square-root factorial bound. For all partitions , one has
This conjecture gives a uniform upper bound on Kronecker multiplicities that is substantially smaller than general bounds suggested by the dimensions of the relevant representations. Its status is not established by the supplied source context.
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.