Related papers: Persistent Pairs And Connectedness In Discrete Mor…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
This paper investigates Hamiltonian properties of the algebro-geometric discretization of KP hierarchy introduced in \cite{Gie1}. A Poisson bracket is introduced. The system is related to the periodic band matrix system of \cite{vM-M}. It…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
Persistent homology theory is a relatively new but powerful method in data analysis. Using simplicial complexes, classical persistent homology is able to reveal high dimensional geometric structures of datasets, and represent them as…
Polyharmonic maps of order k (briefly, k-harmonic maps) are a natural generalization of harmonic and biharmonic maps. These maps are defined as the critical points of suitable higher order functionals which extend the classical energy…
We propose a study of multipartite entanglement through persistent homology, a tool used in topological data analysis. In persistent homology, a 1-parameter filtration of simplicial complexes called persistence complex is used to reveal…
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…
We develop a theory of persistent homology for directed simplicial complexes which detects persistent directed cycles in odd dimensions. We relate directed persistent homology to classical persistent homology, prove some stability results,…
We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. A main result in this paper is that the spectral density function of DMLs…
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…
The aim of this paper is to investigate properties preserved and co-preserved by coarsely $n$-to-1 functions, in particular by the quotient maps $X\to X/\sim$ induced by a finite group $G$ acting by isometries on a metric space $X$. The…
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…
We investigate the concept of Pauli pairs and a discrete counterpart to it. In particular, we make substantial progress on the question of when a discrete Pauli pair is automatically a classical Pauli pair. Effectively, if one of the…
Mathematical descriptions of flow phenomena usually come in the form of partial differential equations. The differential operators used in these equations may have properties such as symmetry, skew-symmetry, positive or negative…
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence…
Suppose $M$ is a finite simplicial complex and that for $0=t_0,t_1,...,t_r=1$ we have a discrete Morse function $F_{t_i}:M\to \zr$. In this paper, we study the births and deaths of critical cells for the functions $F_{t_i}$ and present an…
We prove that the Floer complex that is associated with a convex Hamiltonian function on $\mathbb{R}^{2n}$ is isomorphic to the Morse complex of Clarke's dual action functional that is associated with the Fenchel-dual Hamiltonian. This…
Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. A major obstacle to…
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small…
The classical approach to the study of dynamical systems consists in representing the dynamics of the system in the form of a "source-sink", that means identifying an attractor-repeller pair, which are attractor-repellent sets for all other…