Sequentially $S_r$ simplicial complexes and sequentially $S_2$ graphs
Hassan Haghighi, Naoki Terai, Siamak Yassemi, Rahim Zaare-Nahandi

TL;DR
This paper introduces the concept of sequentially $S_r$ modules and simplicial complexes, generalizing Cohen-Macaulay and Serre's conditions, with applications to graph theory and characterizations of specific cycles.
Contribution
It defines sequentially $S_r$ properties for modules and complexes, characterizes these properties algebraically and combinatorially, and extends results to graphs, especially bipartite and cycle graphs.
Findings
Sequentially $S_r$ complexes are characterized by their pure skeletons.
Only odd cycles are sequentially $S_2$ among cycles.
Bipartite graphs are vertex decomposable if and only if they are sequentially $S_2$.
Abstract
We introduce sequentially modules over a commutative graded ring and sequentially simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying Serre's condition . In analogy with the sequentially Cohen-Macaulay property, we show that a simplicial complex is sequentially if and only if its pure -skeleton is for all . For , we provide a more relaxed characterization. As an algebraic criterion, we prove that a simplicial complex is sequentially if and only if the minimal free resolution of the ideal of its Alexander dual is componentwise linear in the first steps. We apply these results for a graph, i.e., for the simplicial complex of the independent sets of vertices of a graph. We characterize sequentially cycles showing that the only sequentially …
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 · Algebraic structures and combinatorial models · Polynomial and algebraic computation
