Related papers: Combinatorial Morse flows are hard to find
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 present a Morse-theoretic characterization of collapsibility for 2-dimensional acyclic simplicial complexes by means of the values of normalized optimal combinatorial Morse functions.
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
In many applications of the probabilistic method, one looks to study phenomena that occur ``with high probability''. More recently however, in an attempt to understand some of the most fundamental problems in combinatorics, researchers have…
In this paper, we develop the notion of a Morse sequence, which provides an alternative approach to discrete Morse theory, and which is both simple and effective. A Morse sequence on a finite simplicial complex is a sequence composed solely…
We prove that every combinatorial dynamical system in the sense of Forman, defined on a family of simplices of a simplicial complex, gives rise to a multivalued dynamical system F on the geometric realization of the simplicial complex.…
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 consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…
Combinatorial vector fields on simplicial complexes as introduced by Robin Forman have found numerous and varied applications in recent years. Yet, their relationship to classical dynamical systems has been less clear. In recent work it was…
From the perspective of Morse theory, it is natural to investigate gradient flow trajectories between critical points. In this short note, we explore the minimal hypersurface analogue of this phenomenon and present examples that suggest…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
We introduce combinatorial multivector fields, associate with them multivalued dynamics and study their topological features. Our combinatorial multivector fields generalize combinatorial vector fields of Forman. We define isolated…
A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…
We consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By viewing flows and cuts topologically in terms of the simplicial…
In this paper, we use abstract Lyapunov graphs as a combinatorial tool to obtain a complete classification of Smale flows on $\mathbb{S}^2\times\mathbb{S}^1$. This classification gives necessary and sufficient conditions that must be…
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…