Extending simplicial complexes: topological and combinatorial properties
In this work, the authors consider a hypergraph \(\mathcal{H}^\prime\) obtained by gluing some hypergraphs to a central ``arbitrary hypergraph \(\mathcal{H}\) and explore the topological and combinatorial properties like Cohen-Macaulayness, shellability, and vertex-decomposability of \(\mathcal{H}^\prime\). To accomplish this, Section 2 introduces the concept of hybrid hypergraphs, which are constructed by attaching a family of hypergraphs to a central one through a collection of triples that satisfy a specific condition known as the proper independence property. In particular, Theorem 2.4 as the main result of this section, establishes key combinatorial and topological characteristics of hybrid hypergraphs, identifying the conditions under which these structures are sequentially Cohen-Macaulay, shellable, or vertex-decomposable. Next, in Section 3, the authors introduce two such families and demonstrate in Theorems 3.1 and 3.3 that the conclusions of Theorem 2.4 extend to these cases as well. Although the gluing techniques employed here are less general than those in the hybrid case, the glued components in these constructions are not required to satisfy the proper independence property. Finally, in the concluding section, the authors outline several research problems motivated by the arguments and results presented earlier in the paper. The first four problems focus on the assumptions and implications of Theorem 2.4. The fifth problem, taking a more algebraic perspective, suggests exploring additional algebraic properties and invariants associated with the three hypergraph constructions discussed in this work.
- A new construction for Cohen-Macaulay graphs
- Algebraic properties of edge ideals via combinatorial topology
- Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
- Algebraic study on Cameron-Walker graphs
- Balanced vertex decomposable simplicial complexes and their \(h\)-vectors
- Chordal and sequentially Cohen-Macaulay clutters
- Cohen-Macaulay graphs
- Cohen-Macaulay graphs and face vectors of flag complexes
- Cohen-Macaulay properties of square-free monomial ideals
- Combinatorics and commutative algebra.
- Connectivity in hypergraphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- scientific article; zbMATH DE number 482758 (Why is no real title available?)
- scientific article; zbMATH DE number 1565322 (Why is no real title available?)
- New classes of set-theoretic complete intersection monomial ideals
- Obstructions to shellability
- On rigid circuit graphs
- On sequentially Cohen-Macaulay complexes and posets
- Sequentially Cohen-Macaulay edge ideals
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Shellable Nonpure Complexes and Posets. I
- Shellable nonpure complexes and posets. II
- Vertex decomposable graphs and obstructions to shellability
- Whiskers and sequentially Cohen-Macaulay graphs
This page was built for publication: Extending simplicial complexes: topological and combinatorial properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658065)
