Mulmuley's #P conjecture for Kronecker coefficients
Statement
For partitions , , and of the same integer, let denote the Kronecker coefficient, and let be the problem of computing this coefficient from the binary-encoded input. Mulmuley's conjecture.
The paper has the unconditional upper bound ; the conjecture asks for the stronger counting-class upper bound.
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.