Panova's restricted #P conjecture for Kronecker coefficients
Statement
Let be the problem of computing from partitions . Write for the number of parts of , and let denote the rectangular partition with parts equal to .
Panova's restricted-case conjecture. The following two statements are each equivalent to the unrestricted assertion that is in :
and
These equivalences identify two restricted families whose membership in would already settle the general counting question. The surrounding text presents this as a conjectural complexity statement about Kronecker coefficients.
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.