ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For partitions λ\lambda, μ\mu, and ν\nu of the same integer, let g(λ,μ,ν)g(\lambda,\mu,\nu) denote the Kronecker coefficient, and let \textscKron{\textsc{Kron}} be the problem of computing this coefficient from the binary-encoded input. Mulmuley's conjecture.

\textscKron∈#P.{\textsc{Kron}}\in {\rm{\textsf{\#P}}}.

The paper has the unconditional upper bound \textscKron∈GapP{\textsc{Kron}}\in {\rm{\textsf{GapP}}}; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.