Output-sensitive classical algorithm conjecture for Littlewood–Richardson coefficients
Statement
Let , , and be partitions such that . Assume . Output-sensitive Littlewood–Richardson conjecture. There exists a classical algorithm running in time
that computes . This is stated as a stronger conjecture because ; it is known in restricted settings, including fixed-length cases, but remains open in general.
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.