Search

We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We...

topology simplicial complex graphs realization problem Forman equivalence upper bound Geometry and Topology mathematics Physical Sciences and Mathematics