Search

Persistent homology with coefficients in a field $$\mathbb {F}$$ coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors with the simplices. We separate the representation of the simplicial complex from the representation of the cohomology groups, and introduce a new data structure for maintaining the annotation matrix, which is more compact and reduces substantially the amount of matrix operations. In addition, we propose a heuristic to simplify further the representation of the cohomology groups and improve both time and space complexities. The paper provides a theoretical analysis, as well as a detailed experimental study of our implementation and comparison with state-of-the-art software for persistent homology and cohomology. [ABSTRACT FROM AUTHOR]

We describe a parallel polynomial time algorithm for computing the topological Betti numbers of a smooth complex projective variety X. It is the first single exponential time algorithm for computing the Betti numbers of a significant class of complex varieties of arbitrary dimension. Our main theoretical result is that the Castelnuovo-Mumford regularity of the sheaf of differential p-forms on X is bounded by p( em+1) D, where e, m, and D are the maximal codimension, dimension, and degree, respectively, of all irreducible components of X. It follows that, for a union V of generic hyperplane sections in X, the algebraic de Rham cohomology of X∖ V is described by differential forms with poles along V of single exponential order. By covering X with sets of this type and using a Čech process, we obtain a similar description of the de Rham cohomology of X, which allows its efficient computation. Furthermore, we give a parallel polynomial time algorithm for testing whether a projective variety is smooth. [ABSTRACT FROM AUTHOR]