arXiv (All)
open access
Real-rootedness of the $Z$-polynomials of sparse paving matroids and strict interlacing for uniform matroids
We prove that the $Z$-polynomial of every sparse paving matroid has only negative real zeros, confirming the real-rootedness conjecture of Proudfoot, Xu, and Young for this class. We also prove that, for each fixed positive corank, the $Z$-polynomials of uniform matroids in consecutive ranks strictl
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
- Stall Pattern Avoidance in Polynomial Product Codes#1061540
- Linearized Polynomial Chinese Remainder codes#378081
- The Marcus-Minc Transform Inequality#1077191
- On efficient approximation of quadratic irrationals, signed Chebyshev polynomials and Householder's method#927192
- 类固醇上的科学主义:自由进化的里维 (Scientism on Steroids- (A Review of Freedom Evolves by Daniel Dennett (2003)) (回顾修订 2019)#770425
Record · ID 984545
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