Related papers: On merge trees with a given homological sequence
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…
Persistent homology is a common technique in topological data analysis providing geometrical and topological information about the sample space. All this information, known as topological features, is summarized in persistence diagrams, and…
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…
A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\geq 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. We study the behavior of measurable…
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…
We obtain a simple and complete characterisation of which matchings on the Tait graph of a knot diagram induce a discrete Morse function (dMf) on $S^2$, extending a construction due to Cohen. We show these dMfs are in bijection with certain…
The Conley index of an isolated invariant set is a fundamental object in the study of dynamical systems. Here we consider smooth functions on closed submanifolds of Euclidean space and describe a framework for inferring the Conley index of…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…
For Morse-Smale pairs on a smooth, closed manifold the Morse-Smale-Witten chain complex can be defined. The associated Morse homology is isomorphic to the singular homology of the manifold and yields the classical Morse relations for Morse…
We develop functoriality for Morse theory, namely, to a pair of Morse-Smale systems and a generic smooth map between the underlying manifolds we associate a chain map between the corresponding Morse complexes, which descends to the correct…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…
A mutation will affect an individual and some or all of its descendants. In this paper, we investigate ordered trees with a distinguished vertex called the mutator. We describe various mutations in ordered trees, and find the generating…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
Metrics for merge trees that are simultaneously stable, informative, and efficiently computable have so far eluded researchers. We show in this work that it is possible to devise such a metric when restricting merge trees to ordered domains…
The status of a vertex $v$ in a connected graph is the sum of the distances from $v$ to all other vertices. The status sequence of a connected graph is the list of the statuses of all the vertices of the graph. In this paper we investigate…
Recent years have witnessed the rise of compositional semantics as a foundation for formal verification of complex systems. In particular, interaction trees have emerged as a popular denotational semantics. Interaction trees achieve…
In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter…