ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For partitions λ,μ,ν\lambda,\mu,\nu, let ComputeLR\textsf{ComputeLR} be the problem whose input is λ,μ,ν\lambda,\mu,\nu encoded in unary and whose output is the Littlewood–Richardson coefficient cμνλc^{\lambda}_{\mu\nu}. Here unary encoding writes each part using a number of symbols proportional to its value.

Pak–Panova's conjecture. When the input is in unary, ComputeLR\textsf{ComputeLR} is #P\#\mathrm{P}-complete.

For binary input, the source recalls Narayanan's #P\#\mathrm{P}-completeness theorem, whereas the unary case was presented as unresolved. The conjecture asserts that unary encoding does not make the counting problem easier.

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.