$M$-Shellability of Discrete Polymatroids
Majid Alizadeh, Afshin Goodarzi, Siamak Yassemi

TL;DR
This paper proves that all discrete polymatroids are $M$-shellable, confirming a conjecture in a special case and enhancing understanding of the combinatorial properties of these structures.
Contribution
It establishes that every discrete polymatroid is $M$-shellable, advancing the theory of polymatroid shellability and related combinatorial conjectures.
Findings
All discrete polymatroids are $M$-shellable.
Provides a partial positive answer to Chari's conjecture.
Improves results related to Stanley's conjecture for lattice path matroids.
Abstract
In this note we show that every discrete polymatroid is -shellable. This gives, in a partial case, a positive answer to a conjecture of Chari and improves a recent result of Schweig where he proved that the -vector of a lattice path matroid satisfies a conjecture of Stanley.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research · Advanced Algebra and Logic
