Vertex decomposability and weakly polymatroidal ideals
Amir Mafi, Dler Naderi, Hero Saremi

TL;DR
This paper explores the properties of simplicial complexes and monomial ideals, establishing equivalences between various algebraic and combinatorial conditions, and characterizing weakly polymatroidal ideals in terms of linear quotients and vertex splittability.
Contribution
It proves the equivalence of sequentially Cohen-Macaulay, shellable, and vertex decomposable conditions for matroidal ideals, and characterizes degree 2 monomial ideals as weakly polymatroidal if and only if they have linear quotients.
Findings
Equivalence of Cohen-Macaulay, shellability, and vertex decomposability for matroidal ideals.
Conditions under which simplicial complexes are vertex decomposable.
Characterization of degree 2 monomial ideals as weakly polymatroidal with linear quotients.
Abstract
Let be a field and be the polynomial ring in variables over a field . Let be a simplicial complex on vertices and be its Stanley-Reisner ideal. In this paper, we show that if is a matroidal ideal then the following conditions are equivalent: is sequentially Cohen-Macaulay; is shellable; is vertex decomposable. Also, if is a minimally generated by such that or for all , then is vertex decomposable. Furthermore, we prove that if is a monomial ideal of degree then is weakly polymatroidal if and only if has linear quotients if and only if is vertex splittable.
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
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
