Related papers: Computing Height Persistence and Homology Generato…
This paper investigates property QR(3) for Veronese embeddings over an algebraically closed field of characteristic $3$. We determine the rank index of $(\mathbb{P}^n , \mathcal{O}_{\mathbb{P}^n} (d))$ for all $n \geq 2$, $d \geq 3$,…
Since the work of Jennings (1955), it is well-known that any finitely generated torsion-free nilpotent group can be embedded into unitriangular integer matrices $UT_N(Z)$ for some $N$. In 2006, Nickel proposed an algorithm to calculate such…
We introduce a consistent estimator for the homology (an algebraic structure representing connected components and cycles) of level sets of both density and regression functions. Our method is based on kernel estimation. We apply this…
Compression aims to reduce the size of an input, while maintaining its relevant properties. For multi-parameter persistent homology, compression is a necessary step in any computational pipeline, since standard constructions lead to large…
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…
We reformulate the persistent (co)homology of simplicial filtrations, viewed from a more algebraic setting, namely as the (co)homology of a chain complex of graded modules over polynomial ring $K[t]$. We also define persistent (co)homology…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
We study the k nearest neighbors problem in the plane for general, convex, pairwise disjoint sites of constant description complexity such as line segments, disks, and quadrilaterals and with respect to a general family of distance…
We study the ordered configuration spaces of star graphs. Inspired by the representation stability results of Church--Ellenberg--Farb for the ordered configuration space of a manifold and the edge stability results of…
The classical K\"{u}nneth formula in algebraic topology describes the homology of a product space in terms of that of its factors. In this paper, we prove K\"{u}nneth-type theorems for the persistent homology of the categorical and tensor…
The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persistent homology is a key tool in topological data analysis…
Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…
In this paper, we use topological data analysis techniques to construct a suitable neural network classifier for the task of learning sensor signals of entire power plants according to their reference designation system. We use…
We present mathematical models based on persistent homology for analyzing force distributions in particulate systems. We define three distinct chain complexes: digital, position, and interaction, motivated by different capabilities of…
The Persistent Homology Transform (PHT) summarizes a shape in $\mathbb{R}^m$ by collecting persistence diagrams obtained from linear height filtrations in all directions on $\mathbb{S}^{m-1}$. It enjoys strong theoretical guarantees,…
Persistent homology is a common technique in topological data analysis providing geometrical and topological information about the sample space. All this information, known as topological features, is summarized in persistence diagrams, and…
Persistent homology, the study of holes that appear in data as one thickens balls centered around its points over time, has theoretically guaranteed stability. That is, small data perturbations guarantee small changes in the lifetimes of…
A general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure is presented. The obtained simplicial complex preserves all pertinent topological…
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…