Extending simplicial complexes: topological and combinatorial properties (Q6658065)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extending simplicial complexes: topological and combinatorial properties |
scientific article; zbMATH DE number 7962801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extending simplicial complexes: topological and combinatorial properties |
scientific article; zbMATH DE number 7962801 |
Statements
Extending simplicial complexes: topological and combinatorial properties (English)
0 references
8 January 2025
0 references
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.
0 references
sequentially Cohen-Macaulay
0 references
shellable
0 references
vertex-decomposable
0 references
pure
0 references
simplicial complex
0 references
hypergraph
0 references
0.6440459489822388
0 references
0.6431048512458801
0 references
0.6349040269851685
0 references
0.6210395693778992
0 references