Shellability of Componentwise Discrete Polymatroids
In the present paper, motivated by a conjecture of Jahan and Zheng, we prove that componentwise polymatroidal ideals have linear quotients. This solves positively a conjecture of Bandari and Herzog. We introduce componentwise discrete polymatroids, as the combinatorial counterpart of componentwise polymatroidal ideals, and show that they are shellable multicomplexes.
Authors
- Antonino Ficarra
Institutions
- University of Messina (IT)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2025-03-14
- DOI
- https://doi.org/10.37236/12818
- Citations
- 3
- Primary Topic
- Manufacturing Process and Optimization
- Type
- article
- Field-Weighted Citation Impact
- 3.73