ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a matroid presented succinctly, let EqualitySY⁡0\operatorname{EqualitySY}_0 denote the decision problem asking whether equality holds in the k=0k=0 Stanley--Yan inequality. EqualitySY coNP-completeness conjecture. EqualitySY⁡0\operatorname{EqualitySY}_0 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 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.