On The Discrete Morse Functions for Hypergraphs
Combinatorics
2021-08-06 v1
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.
Cite
@article{arxiv.2108.02384,
title = {On The Discrete Morse Functions for Hypergraphs},
author = {Shiquan Ren and Chong Wang and Chengyuan Wu and Jie Wu},
journal= {arXiv preprint arXiv:2108.02384},
year = {2021}
}