相关论文: On Merge Trees and Discrete Morse Functions on Pat…
In this paper, we study merge trees induced by a discrete Morse function on a tree. Given a discrete Morse function, we provide a method to constructing an induced merge tree and define a new notion of equivalence of discrete Morse…
In this paper, we study the induced homological sequence and the induced merge tree of a discrete Morse function on a tree. A discrete Morse function on a tree gives rise to a sequence of Betti numbers that keep track of the number of…
In this paper, we extend the notion of a merge tree to that of a generalized merge tree, a merge tree that includes 1-dimensional cycle birth information. Given a discrete Morse function on a $1$-dimensional regular CW complex, we construct…
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 compare this…
In this work, we introduce a combinatorial-geometric model for the space of discrete Morse functions on any CW complex $X$. We relate this version of a space of discrete Morse functions to the space of cellular filtrations of $X$ and…
We study transformations between discrete Morse functions on a finite simplicial complex via birth-death transitions--elementary chain maps between discrete Morse complexes that either create or cancel pairs of critical simplices. We prove…
Given two discrete Morse functions on a simplicial complex, we introduce the {\em connectedness homomorphism} between the corresponding discrete Morse complexes. This concept leads to a novel framework for studying the connectedness in…
There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…
We investigate properties of the set of discrete Morse functions on a simplicial complex as defined by Forman. It is not difficult to see that the pairings of discrete Morse functions of a finite simplicial complex again form a simplicial…
We introduce the notion of a Morse sequence, which provides a simple and effective approach to discrete Morse theory. A Morse sequence is a sequence composed solely of two elementary operations, that is, expansions (the inverse of a…
We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…
In this paper, we give a necessary and sufficient condition that discrete Morse functions on a digraph can be extended to be Morse functions on its transitive closure, from this we can extend the Morse theory to digraphs by using…
Let $F$ be a discrete Morse function on a simplicial complex $L$. We construct a discrete Morse function $\Delta(F)$ on the barycentric subdivision $\Delta(L)$. The constructed function $\Delta(F)$ "behaves the same way" as $F$, i. e. has…
In this paper, we investigate vector fields on polyhedral complexes and their associated trajectories. We study vector fields which are analogue of the gradient vector field of a function in the smooth case. Our goal is to define a nice…
Inspired by the works of Forman on discrete Morse theory, which is a combinatorial adaptation to cell complexes of classical Morse theory on manifolds, we introduce a discrete analogue of the stratified Morse theory of Goresky and…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological…
We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…
We prove an infinite analogue of the main theorem of discrete Morse theory formulated in terms of discrete Morse matchings. Our theorem holds under the assumption that the given Morse matching induces finitely many equivalence classes of…