Related papers: Morse Theoretic Templates for High Dimensional Hom…
We study the topology of moduli spaces of closed linkages in \R^d depending on a length vector \ell\in \R^n. In particular, we use equivariant Morse theory to obtain information on the homology groups of these spaces, which works best for…
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not…
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…
The Mayer-Vietoris theorem is known for its wide applications, especially in determining homology. In fact, this theorem provides us with a long exact sequence, where the underlying homology groups fit in. However, this theorem does not…
In this work, we design a nearly linear time discrete Morse theory based algorithm for computing homology groups of 2-manifolds, thereby establishing the fact that computing homology groups of 2-manifolds is remarkably easy. Unlike previous…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
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…
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…
Distributed memory machines equipped with CPUs and GPUs (hybrid computing nodes) are hard to program because of the multiple layers of memory and heterogeneous computing configurations. In this paper, we introduce a region template…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
The aim of this paper is to study the behavior of Hodge-theoretic (intersection homology) genera and their associated characteristic classes under proper morphisms of complex algebraic varieties. We obtain formulae that relate (parametrized…
Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…
We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…
We introduce a perfect discrete Morse function on the moduli space of a polygonal linkage. The ingredients of the construction are: (1) the cell structure on the moduli space, and (2) the discrete Morse theory approach, which allows to…
In this paper, we study Forman's discrete Morse theory in the context of weighted homology. We develop weighted versions of classical theorems in discrete Morse theory. A key difference in the weighted case is that simplicial collapses do…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
Forman introduced discrete Morse theory as a tool for studying CW complexes by essentially collapsing them onto smaller, simpler-to-understand complexes of critical cells in [Fo]. Chari reformulated discrete Morse theory for regular cell…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…