New methods for constructing shellable simplicial complexes

Authors
Mohammad Farrokhi D. G.
Ali Akbar Yazdan Pour
Institute for Advanced Studies in Basic Sciences (IASBS)
Abstract
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}$ we correspond its circuit ideal $I(mathcal{C})$ generated by monomials $x_{i_1}cdots x_{i_k}$ with ${i_1,ldots,i_k}inmathcal{C}$. Conversely, to each square-free monomial ideal $I$ with minimal set of generators $mathcal{G}(I)$, we correspond a clutter with circuits ${i_1,ldots,i_k}$, where $x_{i_1}cdots x_{i_k}inmathcal{G}(I)$. The independence complex of a clutter $mathcal{C}$ on $[n]$ is the simplicial complex $Delta_{mathcal{C}}$ whose faces are independent sets in $mathcal{C}$ by which we mean sets $Fsubseteq [n]$ such that $ensubseteq F$ for all $einmathcal{C}$. It is easy to see that the Stanley-Reisner ideal of $Delta_{mathcal{C}}$ coincides with $I(mathcal{C})$. The above correspondence establishes a one-to-one correspondence between simplicial complexes and independence complex of clutters. A simplicial complex $Delta$ is shellable if there exists a total order on its facets, say $F_1
Keywords
Clutter
Hybrid clutter
Shellability
Cohen-Macaulay
Independence complex
1. J. Biermann, and A. Van Tuyl, “Balanced vertex decomposable simplicial complexes and their h-vectors”, Electron. J. Combin. 20(3) (2013), #R15.

2. A. Björner and M. Wachs, “Shellable nonpure complexes and posets. I”, Trans. Amer. Math. Soc. 348(4) (1996), 3945-3975.

3. W. Bruns and J. Herzog, “Cohen-Macaulay Rings”, Cambridge Studies in Advanced Mathematics, 39. Cambridge University Press, Cambridge, (1993).

4. D. Cook II and U. Nagel, “Cohen-Macaulay graphs and face vectors of flag complexes”, SIAM J. Discret. Math. 26(1) (2012), 89-101.

5. A. Dochtermann and A. Engström, “Algebraic properties of edge ideals via combinatorial topology”, Electron. J. Combin. 16(2) (2009), #R2.

6. S. Faridi, “Cohen-Macaulay properties of square-free monomial ideals”, J. Combin. Theory Ser. A 109(2) (2005), 299-329.

7. A. Francisco and A. Van Tuyl, “Sequentially Cohen-Macaulay edge ideals”, Proc. Amer. Math. Soc. 135(8) (2007), 2327-2337.

8. J. Gallier, “Notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi diagrams and Delaunay triangulations”, arXiv: 0805.0292 (2008).

9. X. Goaoc, P. Paták, Z. Patáková, M. Tancer, and U. Wagner, “Shellability is NP-complete”, J. ACM 66(3) (2019), Art. 21, 18 pp.

10. T. Hibi, A. Higashitani, K. Kimura, and A. B. O'Keefe, “Algebraic study on Cameron-Walker graphs”, J. Algebra 422 (2015), 257-269.

11. A. Macchia, “The arithmetical rank of the edge ideals of graphs with whisker”, Beitr. Algebra Geom. 56 (2015), 147-158.

12. Mousivand, S. A. Seyed Fakhari, and S. Yassemi, “A new construction for Cohen-Macaulay graphs”, Comm. Algebra 43(2) (2015), 5104-5112.

13. M. R. Pournaki, S. A. Seyed Fakhari, and S. Yassemi, “New classes of set-theoretic complete intersection monomial ideals”, Comm. Algebra 43(9) (2015), 3920-3924.

14. R. P. Stanley, “Combinatorics and Commutative Algebra”, 2nd ed., Progr. Math. 41, Birkhäuser Boston, Boston, MA (1996).

15. R. H. Villarreal, “Cohen-Macaulay graphs”, Manus. Math. 66 (1990), 277-293.

16. R. H. Villarreal, “Monomial Algebras”, Monographs and Textbooks in Pure and Applied Mathematics, vol. 238, Marcel Dekker, Inc., New York, 2001.
Mathematical Research
Volume 8, Issue 4 - Serial Number 23
Autumn 2022
Pages 164-179