On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class

12/04/2021
by   Erin Wolf Chambers, et al.
0

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 representative in that homology class which is optimal. We study two measures of optimality, namely, the lexicographic order of cycles (the lex-optimal cycle) and the bottleneck norm (a bottleneck-optimal cycle). We give a simple algorithm for computing the lex-optimal cycle for a 1-homology lass in a closed orientable surface. In contrast to this, our main result is that, in the case of 3-Manifolds of size n^2 in the Euclidean 3-space, the problem of finding a bottleneck optimal cycle cannot be solved more efficiently than solving a system of linear equations with an n × n sparse matrix. From this reduction, we deduce several hardness results. Most notably, we show that for 3-manifolds given as a subset of the 3-space of size n^2, persistent homology computations are at least as hard as rank computation (for sparse matrices) while ordinary homology computations can be done in O(n^2 log n) time. This is the first such distinction between these two computations. Moreover, it follows that the same disparity exists between the height persistent homology computation and general sub-level set persistent homology computation for simplicial complexes in the 3-space.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2021

Computing Optimal Persistent Cycles for Levelset Zigzag on Manifold-like Complexes

In standard persistent homology, a persistent cycle born and dying with ...
research
05/14/2021

Minimal Cycle Representatives in Persistent Homology using Linear Programming: an Empirical Study with User's Guide

Cycle representatives of persistent homology classes can be used to prov...
research
06/24/2021

Optimal Fine-grained Hardness of Approximation of Linear Equations

The problem of solving linear systems is one of the most fundamental pro...
research
12/05/2022

Connecting Discrete Morse Theory and Persistence: Wrap Complexes and Lexicographic Optimal Cycles

We study the connection between discrete Morse theory and persistent hom...
research
12/14/2017

Volume Optimal Cycle: Tightest representative cycle of a generator on persistent homology

This paper shows a mathematical formalization, algorithms and computatio...
research
09/30/2022

Fast Topological Signal Identification and Persistent Cohomological Cycle Matching

Within the context of topological data analysis, the problems of identif...
research
08/19/2021

U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology

Persistent homology is a leading tool in topological data analysis (TDA)...

Please sign up or login with your details

Forgot password? Click here to reset