ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \bla\bla, \bmu\bmu, and \bnu\bnu be partitions such that ∣\bla∣=∣\bmu∣+∣\bnu∣|\bla|=|\bmu|+|\bnu|. Littlewood–Richardson algorithm conjecture. There exists a classical algorithm running in time

O(f\blaf\bmuf\bnupoly⁡(n))O\left(\frac{f^\bla}{f^\bmu f^\bnu}\operatorname{poly}(n)\right)

that computes the Littlewood–Richardson coefficient c\bmu\bnu\blac^\bla_{\bmu\bnu}. The conjecture is a proposed classical counterpart to the known quantum runtime, with polynomial-time algorithms already available in some restricted cases such as fixed ell(\bla)ell(\bla); the general case remains open.

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.