Related papers: Computing Betti tables and minimal presentations o…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…
The Betti numbers are fundamental topological quantities that describe the k-dimensional connectivity of an object: B_0 is the number of connected components and B_k effectively counts the number of k-dimensional holes. Although they are…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
We present an algebraic framework for the computation of low-degree cohomology of a class of bigraded complexes which arise in Poisson geometry around (pre)symplectic leaves. We also show that this framework can be applied to the more…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Given a graded $E_1$-module over an $E_2$-algebra in spaces, we construct an augmented semi-simplicial space up to higher coherent homotopy over it, called its canonical resolution, whose graded connectivity yields homological stability for…
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…
The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort. It contains information for connected multigraphs having at…
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,…
In the context of discrete Morse theory, we introduce Morse frames, which are maps that associate a set of critical simplexes to all simplexes. The main example of Morse frames are the Morse references. In particular, these Morse references…
Topological Data Analysis (TDA) is a rising field of computational topology in which the topological structure of a data set can be observed by persistent homology. By considering a sequence of sublevel sets, one obtains a filtration that…
We define bigraded persistent homology modules and bigraded barcodes of a finite pseudo-metric space X using the ordinary and double homology of the moment-angle complex associated with the Vietoris-Rips filtration of X. We prove a…
We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…
Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…
We discuss the category $\cal I$ of level zero integrable representations of loop algebras and their generalizations. The category is not semisimple and so one is interested in its homological properties. We begin by looking at some…
Graph embeddings play a critical role in graph representation learning, allowing machine learning models to explore and interpret graph-structured data. However, existing methods often rely on opaque, high-dimensional embeddings, limiting…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
Visualization in the emerging field of topological data analysis has progressed from persistence barcodes and persistence diagrams to display of two-parameter persistent homology. Although persistence barcodes and diagrams have permitted…