Skip to main content
Log in

Computing Betti Numbers via Combinatorial Laplacians

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requires small storage space in many cases. It seems to run quickly in practice, but its running time depends on a ratio, ν , of eigenvalues which we have yet to understand fully.

We numerically verify a conjecture of Bj{ö}rner, Lov{á}sz, Vre{\'c}ica, and {\u Z}ivaljevi{\'c} on the chessboard complexes C(4,6) , C(5,7) , and C(5,8) . Our verification suffers a technical weakness, which can be overcome in various ways; we do so for C(4,6) and C(5,8) , giving a completely rigorous (computer) proof of the conjecture in these two cases. This brings up an interesting question in recovering an integral basis from a real basis of vectors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 23, 1995; revised December 7, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Friedman, J. Computing Betti Numbers via Combinatorial Laplacians. Algorithmica 21, 331–346 (1998). https://doi.org/10.1007/PL00009218

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009218

Navigation