Related papers: Computing Connection Matrices of Conley Complexes …
We give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
We propose an efficient linear-time graph-based divisive cluster analysis approach called Reductive Clustering. The approach tries to reveal the hierarchical structural information through reducing the graph into a more concise one…
We present a detailed description of a fundamental group algorithm based on Forman's combinatorial version of Morse theory. We use this algorithm in a classification problem of prime knots up to 14 crossings.
Banyaga and Hurtubise defined the Morse-Bott-Smale chain complex as a quotient of a large chain complex by introducing five degeneracy relations. However, their five degeneracy relations are in fact redundant. In the present paper, we unify…
We compute magnitude homology of various graphs using algebraic Morse theory. Specifically, we (1) give an alternative proof that trees are diagonal, (2) identify a new class of diagonal graphs, (3) prove that the icosahedral graph is…
The aim of this paper is to introduce a novel dictionary learning algorithm for sparse representation of signals defined over combinatorial topological spaces, specifically, regular cell complexes. Leveraging Hodge theory, we embed topology…
Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical systems -- a…
The Temperley--Lieb algebra is a finite dimensional associative algebra that arose in the context of statistical mechanics and occurs naturally as a quotient of the Hecke algebra arising from a Coxeter group of type $A$. It is often…
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…
In this article, we recover singularly-perturbed linear differential systems from their turning points and reduce the rank of the singularity in the parameter to its minimal integer value. Our treatment is Moser-based; that is to say it is…
We introduce a technique that is capable to filter out information from complex systems, by mapping them to networks, and extracting a subgraph with the strongest links. This idea is based on the Minimum Spanning Tree, and it can be applied…
We apply a Bethe-Peierls approach to statistical-mechanics models defined on random networks of arbitrary degree distribution and arbitrary correlations between the degrees of neighboring vertices. Using the NP-hard optimization problem of…
We provide a novel framework to compute a discrete vector potential of a given discrete vector field on arbitrary polyhedral meshes. The framework exploits the concept of acyclic matching, a combinatorial tool at the core of discrete Morse…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard,…
Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of…
The Betti tables of a multigraded module encode the grades at which there is an algebraic change in the module. Multigraded modules show up in many areas of pure and applied mathematics, and in particular in topological data analysis, where…
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filtration of complexes $(K_i)$, we introduce a zigzag Morse…
Our work is concerned with simplicial complexes that describe higher-order interactions in real complex systems. This description allows to go beyond the pairwise node-to-node representation that simple networks provide and to capture a…
We propose a novel model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix that models the…