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{o}rner, Lov{a}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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.