DeepAI AI Chat
Log In Sign Up

Computing Height Persistence and Homology Generators in R^3 Efficiently

by   Tamal K. Dey, et al.
The Ohio State University

Recently it has been shown that computing the dimension of the first homology group H_1(K) of a simplicial 2-complex K embedded linearly in R^4 is as hard as computing the rank of a sparse 0-1 matrix. This puts a major roadblock to computing persistence and a homology basis (generators) for complexes embedded in R^4 and beyond in less than quadratic or even near-quadratic time. But, what about dimension three? It is known that persistence for piecewise linear functions on a complex K with n simplices can be computed in O(n n) time and a set of generators of total size k can be computed in O(n+k) time when K is a graph or a surface linearly embedded in R^3. But, the question for general simplicial complexes K linearly embedded in R^3 is not completely settled. No algorithm with a complexity better than that of the matrix multiplication is known for this important case. We show that the persistence for height functions on such complexes, hence called height persistence, can be computed in O(n n) time. This allows us to compute a basis (generators) of H_i(K), i=1,2, in O(n n+k) time where k is the size of the output. This improves significantly the current best bound of O(n^ω), ω being the matrix multiplication exponent. We achieve these improved bounds by leveraging recent results on zigzag persistence in computational topology, new observations about Reeb graphs, and some efficient geometric data structures.


page 1

page 2

page 3

page 4


Computing Zigzag Persistence on Graphs in Near-Linear Time

Graphs model real-world circumstances in many applications where they ma...

Revisiting Graph Persistence for Updates and Efficiency

It is well known that ordinary persistence on graphs can be computed mor...

Computing with quasiseparable matrices

The class of quasiseparable matrices is defined by a pair of bounds, cal...

On Matrix Multiplication and Polynomial Identity Testing

We show that lower bounds on the border rank of matrix multiplication ca...

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank

We show that a form of strong simulation for n-qubit quantum stabilizer ...

Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time

Currently, in the numerical linear algebra community, it is thought that...