Strong #P-hardness conjecture for Kronecker and Littlewood–Richardson coefficients
Statement
Let denote Kronecker coefficients and denote Littlewood–Richardson coefficients. Strong hardness conjecture. The Kronecker coefficients and the Littlewood–Richardson coefficients are strongly -hard.
This concerns hardness under unary-style input measures, contrasting with the polynomial-time behavior for fixed numbers of parts discussed earlier. The supplied text presents the claim as a belief and provides no resolution evidence.
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.