Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient algorithms for computing a minimal homology basis

Published 21 Jan 2018 in math.AT, cs.CG, and math.CO | (1801.06759v1)

Abstract: Efficient computation of shortest cycles which form a homology basis under Z2\mathbb{Z}_2-additions in a given simplicial complex K\mathcal{K} has been researched actively in recent years. When the complex K\mathcal{K} is a weighted graph with nn vertices and mm edges, the problem of computing a shortest (homology) cycle basis is known to be solvable in O(m2n/log⁡n+n2m)O(m^2n/\log n+ n^2m)-time. Several works \cite{borradaile2017minimum, greedy} have addressed the case when the complex K\mathcal{K} is a $2$-manifold. The complexity of these algorithms depends on the rank gg of the one-dimensional homology group of K\mathcal{K}. This rank gg has a lower bound of Θ(n)\Theta(n), where nn denotes the number of simplices in K\mathcal{K}, giving an O(n4)O(n^4) worst-case time complexity for the algorithms in \cite{borradaile2017minimum,greedy}. This worst-case complexity is improved in \cite{annotation} to O(nω+n2gω−1)O(n^\omega + n^2g^{\omega-1}) for general simplicial complexes where ω<2.3728639\omega< 2.3728639 \cite{le2014powers} is the matrix multiplication exponent. Taking g=Θ(n)g=\Theta(n), this provides an O(nω+1)O(n^{\omega+1}) worst-case algorithm. In this paper, we improve this time complexity. Combining the divide and conquer technique from \cite{DivideConquer} with the use of annotations from \cite{annotation}, we present an algorithm that runs in O(nω+n2g)O(n^\omega+n^2g) time giving the first O(n3)O(n^3) worst-case algorithm for general complexes. If instead of minimal basis, we settle for an approximate basis, we can improve the running time even further. We show that a $2$-approximate minimal homology basis can be computed in O(nωnlog⁡n)O(n^{\omega}\sqrt{n \log n}) expected time. We also study more general measures for defining the minimal basis and identify reasonable conditions on these measures that allow computing a minimal basis efficiently.

Authors (3)
Citations (23)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.