Completeness conjecture for equality cases of Stanley's inequalities
Statement
Let denote the relevant equality-verification problem for the th Stanley inequality. EqualityStanley completeness conjecture. The problem is -complete for sufficiently large . The source presents this as an assertion in a conjecture environment but supplies no resolution or further explanation of the encoding; it concerns the computational complexity of equality cases for Stanley-type matroid inequalities.
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.