ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let lambdalambda, mumu, and nunu be partitions of nn, and suppose that flambda≥fmu≥fnuf^{lambda}\geq f^{mu}\geq f^{nu}. Kronecker algorithm conjecture. The Kronecker coefficient g(lambda,mu,nu)g(lambda,mu,nu) can be computed by a classical algorithm in time

O(fμfνfλpoly⁡(n)).O\left(\frac{f^{\mu}f^{\nu}}{f^{\lambda}}\operatorname{poly}(n)\right).

The conjecture is posed as the opposite of the paper’s refuted expectation that no analogous classical algorithm exists for Kronecker coefficients. The paper proves efficient classical algorithms in substantial regimes, but the conjecture remains open in full generality.

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.