Related papers: Persistent Pairs And Connectedness In Discrete Mor…
The goal of this paper is to classify pairs of Morse functions in general position modulo the action of different groups.In particular, we obtain the classification of generic pairs of Morse functions, with or without target…
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…
Given a simplicial complex $K$ and an injective function $f$ from the vertices of $K$ to $\mathbb{R}$, we consider algorithms that extend $f$ to a discrete Morse function on $K$. We show that an algorithm of King, Knudson and Mramor can be…
The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…
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…
This note contributes to the point calculus of persistent homology by extending Alexander duality to real-valued functions. Given a perfect Morse function $f: S^{n+1} \to [0,1]$ and a decomposition $S^{n+1} = U \cup V$ such that $M = \U…
We study sublevel set and superlevel set persistent homology on discrete functions through the perspective of finite ordered sets of both linearly ordered and cyclically ordered domains. Finite ordered sets also serve as the codomain of our…
We prove a discrete version of the Lusternik-Schnirelmann theorem for discrete Morse functions and the recently introduced simplicial Lusternik-Schnirelmann category of a simplicial complex. To accomplish this, a new notion of critical…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex $C$, from which topological and geometrical informations…
Connection matrices are a generalization of Morse boundary operators from the classical Morse theory for gradient vector fields. Developing an efficient computational framework for connection matrices is particularly important in the…
We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher…
Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is called a connection matrix.These matrices, a generalization…
Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…
Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…
We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…
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…