Panova's equivalence conjecture for #P computation of Kronecker coefficients
Statement
Let be the problem of computing from partitions , and let denote the number of parts of . Panova's conjecture. The problem is in when restricted to if and only if it is in in the general case. Likewise, restricting to inputs with and yields membership in if and only if the general problem is in .
The claim proposes that two structured families capture the general -membership question; the source gives no resolution.
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.