The coNP-completeness of EqualitySY for binary and bicircular matroids
Statement
For a matroid presented succinctly, let denote the decision problem asking whether equality holds in the Stanley--Yan inequality. EqualitySY coNP-completeness conjecture. is coNP-complete for binary and for bicircular matroids. The source notes that the problem is already known to be coNP-complete for binary matroids in the analogous Mason setting, while polynomial-time algorithms exist for regular matroids; the conjectured hardness for EqualitySY 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.