The concise symmetric Kronecker coefficient conjecture
Statement
For a partition , let be the Kronecker coefficient and define the symmetric Kronecker coefficient by
A counting function is concise if every positive integer occurs as a value on an input whose size is bounded by a fixed polynomial in . Symmetric Kronecker coefficient conjecture. The function is concise. The function is known to be complete and its maximum on partitions of size has exponential order, but the asserted polynomial-size realization of every value remains open.
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.