Related papers: Ladder Decomposition for Morphisms of Persistence …
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
A well-known property of unordered configuration spaces of points (in an open, connected manifold) is that their homology stabilises as the number of points increases. We generalise this result to moduli spaces of submanifolds of higher…
The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…
We extend the methods of geometric invariant theory to actions of non--reductive groups in the case of homomorphisms between decomposable sheaves whose automorphism groups are non--reductive. Given a linearization of the natural action of…
Higher degree forms are homogeneous polynomials of degree $d > 2,$ or equivalently symmetric $d$-linear spaces. This paper is mainly concerned about the algebraic structure of the centers of higher degree forms with applications…
A unified description of the relationship between the Hamiltonian structure of a large class of integrable hierarchies of equations and W-algebras is discussed. The main result is an explicit formula showing that the former can be…
We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges,…
We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…
We study the multi-dimensional persistence of Carlsson and Zomorodian and obtain a finer classification based upon the higher tor-modules of a persistence module. We propose a variety structure on the set of isomorphism classes of these…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections…
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…
The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
High-accuracy prediction of the physical properties of amorphous materials is challenging in condensed-matter physics. A promising method to achieve this is machine-learning potentials, which is an alternative to computationally demanding…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for…
Cohomological ideas have recently been injected into persistent homology and have for example been used for accelerating the calculation of persistence diagrams by the software Ripser. The cup product operation which is available at…