ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ComputeKron\textsf{ComputeKron} be the problem of computing g(λ,μ,ν)g(\lambda,\mu,\nu) from partitions λ,μ,ν\lambda,\mu,\nu. Write ℓ(λ)\ell(\lambda) for the number of parts of λ\lambda, and let (nd)(n^d) denote the rectangular partition with dd parts equal to nn.

Panova's restricted-case conjecture. The following two statements are each equivalent to the unrestricted assertion that ComputeKron\textsf{ComputeKron} is in #P\#\mathrm{P}:

ComputeKron∈#P when ℓ(λ)=2⟺ComputeKron∈#P,\textsf{ComputeKron}\in\#\mathrm{P}\text{ when }\ell(\lambda)=2 \quad\Longleftrightarrow\quad \textsf{ComputeKron}\in\#\mathrm{P},

and

ComputeKron∈#P for μ=ν=(nd), λ⊢nd⟺ComputeKron∈#P.\textsf{ComputeKron}\in\#\mathrm{P}\text{ for }\mu=\nu=(n^d),\ \lambda\vdash nd \quad\Longleftrightarrow\quad \textsf{ComputeKron}\in\#\mathrm{P}.

These equivalences identify two restricted families whose membership in #P\#\mathrm{P} 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 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.