2000 character limit reached
On The Discrete Morse Functions for Hypergraphs (2108.02384v1)
Published 5 Aug 2021 in math.CO
Abstract: A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. In this paper, we study the embedded homology as well as the homology of the (lower-)associated simplicial complexes for hypergraphs. We generalize the discrete Morse functions on simplicial complexes. We study the discrete Morse functions on hypergraphs as well as the discrete Morse functions on the (lower-)associated simplicial complexes of the hypergraphs.