Gradient Vector Fields of Discrete Morse Functions are Minimum Spanning Forests
share
In this paper, we prove that discrete Morse functions are equivalent to simplicial stacks under reasonable constraints. We also show that, as in Discrete Morse Theory, we can see the GVF of a simplicial stack (seen as a discrete Morse function) as the only relevant information we should consider. Last, but not least, we prove that the Minimum Spanning Forest on the dual graph of a simplicial stack (or a discrete Morse function) is equal to the GVF of the initial function. In other words, the GVF of a discrete Morse function is related to a classic combinatorial minimization problem. This paper is the sequel of a sequence of papers showing that strong relations exist between different domains: Topology, Discrete Morse Theory, Topological Data Analysis and Mathematical Morphology.
READ FULL TEXT
