Extending simplicial complexes: Topological and combinatorial properties
Mohammad Farrokhi Derakhshandeh Ghouchan, Alireza Shamsian, and Ali, Akbar Yazdan Pour

TL;DR
This paper introduces three gluing techniques for hypergraphs that allow constructing larger hypergraphs with controlled topological and combinatorial properties, enabling the creation of broad classes of simplicial complexes with desired features.
Contribution
It presents novel gluing methods to extend simplicial complexes while preserving properties like Cohen-Macaulayness and shellability, offering new tools for topological and combinatorial construction.
Findings
Developed three gluing techniques for hypergraphs
Controlled topological properties in extended complexes
Constructed broad classes of complexes with desired properties
Abstract
Given an arbitrary hypergraph , we may glue to a family of hypergraphs to get a new hypergraph having as an induced subhypergraph. In this paper, we introduce three gluing techniques for which the topological and combinatorial properties (such as Cohen-Macaulayness, shellability, vertex-decomposability etc.) of the resulting hypergraph is under control in terms of the glued components. This enables us to construct broad classes of simplicial complexes containing a given simplicial complex as induced subcomplex satisfying nice topological and combinatorial properties. Our results will be accompanied with some interesting open problems.
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
TopicsTopological and Geometric Data Analysis · Commutative Algebra and Its Applications · Advanced Combinatorial Mathematics
