arXiv (All)
open access
Equality cases of the Stanley--Yan log-concave matroid inequality
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 orig
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Equality cases of the Stanley--Yan log-concave matroid inequality#920791
- An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs#1012787
- Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases#1036087
- Awesome graph parameters#1063805
- Sharp quantitative Talenti's inequality in particular cases#163102
Record · ID 925025
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive