REVIEW 3 cited by
Equality cases of the Stanley--Yan log-concave matroid inequality
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The \emph{Stanley--Yan} (SY) \emph{inequality} gives the ultra-log-concavity for the numbers of bases of a matroid which have given sizes of intersections with $k$ fixed disjoint sets. The inequality was proved by Stanley (1981) for regular matroids, and by Yan (2023) in full generality. In the original paper, Stanley asked for equality conditions of the SY~inequality, and proved total equality conditions for regular matroids in the case $k=0$. In this paper, we completely resolve Stanley's problem. First, we obtain an explicit description of the equality cases of the SY inequality for $k=0$, extending Stanley's results to general matroids and removing the ``total equality'' assumption. Second, for $k\ge 1$, we prove that the equality cases of the SY inequality cannot be described in a sense that they are not in the polynomial hierarchy unless the polynomial hierarchy collapses to a finite level.
Forward citations
Cited by 3 Pith papers
-
Equality conditions for correlation inequalities
Equality in the Ahlswede–Daykin and FKG inequalities holds if and only if the underlying lattice decomposes as a direct product and the functions cross-factor across the two components.
-
Effective resistance in planar graphs and continued fractions
For every rational resistance c/t, a simple planar graph with O(max(t/c, t/(t-c), log t)) vertices exists, and no graph can do better up to a constant.
-
Positivity of Schubert Coefficients
Under GRH and the Miltersen-Vinodchandran assumption, the positivity of Schubert coefficients has a positive rule, equivalent to the problem being in NP.
Discussion (0). Continue with ORCID to comment.