Related papers: Measuring and Localing Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we define an optimal basis of a homology group to be the basis…
In the companion paper, we measured homology classes and computed the optimal homology basis. This paper addresses two related problems, namely, localization and stability. We localize a class with the cycle minimizing a certain objective…
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…
The notions of Betti numbers and of Bass numbers of a finite module N over a local ring R are extended to modules that are only assumed to be finite over S, for some local homomorphism f: R --> S. Various techniques are developed to study…
Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…
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).…
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…
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…
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…
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…
Numerical homogenization aims to efficiently and accurately approximate the solution space of an elliptic partial differential operator with arbitrarily rough coefficients in a $d$-dimensional domain. The application of the inverse operator…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the $1$-dimensional homology classes with $\mathbb{Z}_2$ coefficients in a given simplicial complex $K$. This problem has been…
A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…
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…
We compute the cohomology with trivial coefficients of Lie algebras $\mathfrak{m}_0$ and $\mathfrak{m}_2$ of maximal class over the field $\mathbb{Z}_2$. In the infinite-dimensional case, we show that the cohomology rings…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…
We study the homology groups of the complement of a complexified real line arrangement with coefficients in complex rank-one local systems. Using Borel--Moore homology, we establish an algorithm computing their dimensions via the real…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak…
One of the most useful methods for studying the stable homotopy category is localising at some spectrum E. For an arbitrary stable model category we introduce a candidate for the E-localisation of this model category. We study the…