Pak–Panova's unary Littlewood–Richardson completeness conjecture
Statement
For partitions , let be the problem whose input is encoded in unary and whose output is the Littlewood–Richardson coefficient . 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, is -complete.
For binary input, the source recalls Narayanan's -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.