Related papers: Persistent homology of semi-algebraic sets

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…

Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…

Let $S \subset \R^{k + m}$ be a compact semi-algebraic set defined by a system of $\ell$ polynomial inequalities of degree at most 2. $ Let $\pi$ denote the standard projection from $\R^{k + m}$ onto $\R^m$. We prove that for any $q >0$,…

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…

We prove a bound conjectured by Itenberg on the Betti numbers of real algebraic hypersurfaces near non-singular tropical limits. These bounds are given in terms of the Hodge numbers of the complexification. To prove the conjecture we…

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…

In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and…

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the…

We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies…

The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex…

Persistent homology encodes the evolution of homological features of a multifiltered cell complex in the form of a multigraded module over a polynomial ring, called a multiparameter persistence module, and quantifies it through invariants…

We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. Previous methods of comparable strength worked only for embedding dimension three or under very specific conditions. We…

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…

We introduce and study A-infinity persistence of a given homology filtration of topological spaces. This is a family, one for each n > 0, of homological invariants which provide information not readily available by the (persistent) Betti…

Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…