Related papers: Computing Betti tables and minimal presentations o…
Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…
Clustering aims to form groups of similar data points in an unsupervised regime. Yet, clustering complex datasets containing critically intertwined shapes poses significant challenges. The prevailing clustering algorithms widely depend on…
Topology is the foundation for many industrial applications ranging from CAD to simulation analysis. Computational topology mostly focuses on structured data such as mesh, however unstructured dataset such as point set remains a virgin land…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales.…
Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the…
This report outlines a combinatorial recipe for computing the bases, whose elements are oriented polygons, of two cohomology spaces associated to multizeta values: the top dimensional de Rham cohomology of moduli spaces of genus 0 complex…
For the double complex structure of grading-restricted vertex algebra cohomology defined in \cite{Huang}, we introduce a multiplication of elements of double complex spaces. We show that the orthogonality and bi-grading conditions applied…
In this paper we study topology of the variety of closed planar polygons with given side lengths. We describe the Betti numbers of the moduli spaces as functions of the length vector. We also find sharp upper bounds on the sum of Betti…
Multiparameter persistent homology has emerged as a powerful generalization of topological data analysis, capable of encoding multivariate filtrations. However, the algebraic complexity of multiparameter persistence modules, marked by wild…
We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…
The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would permit multi-parameter…
Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in…
Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
An exact computation of the persistent Betti numbers of a submanifold $X$ of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of $X$ is available. We show that, under suitable…
We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we…
Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…
The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special…