arXiv (All)
open access
g-Positivity for Paving Matroids
We prove that the g-polynomial of every paving matroid has nonnegative coefficients. Our proof combines a deletion-contraction argument with an elementary coefficient inequality for the g-polynomials of uniform matroids.
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
- Ehrhart positivity for lattice path matroids#926041
- Towards combinatorial derivations of K-polynomials for determinantal varieties#609326
- The AHI family of sum of squares polynomials#783194
- Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991
- Making spanning graphs#1122858
Record · ID 1105156
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