Pak and Robichaux's coNP-hardness conjecture for Schubert vanishing
Statement
Let denote the decision problem of determining whether a Schubert coefficient vanishes. Pak and Robichaux's conjecture. The problem is -hard. This conjecture concerns the computational complexity of deciding vanishing of Schubert coefficients, a problem related to the search for combinatorial interpretations and positive rules. Its resolution would clarify the hardness of this central problem in algebraic combinatorics.
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.