English

Laplacian eigenvalues of independence complexes via additive compound matrices

Combinatorics 2024-12-19 v2

Abstract

The independence complex of a graph G=(V,E)G=(V,E) is the simplicial complex I(G)I(G) on vertex set VV whose simplices are the independent sets in GG. We present new lower bounds on the eigenvalues of the kk-dimensional Laplacian Lk(I(G))L_k(I(G)) in terms of the eigenvalues of the graph Laplacian L(G)L(G). As a consequence, we show that for all k0k\geq 0, the dimension of the kk-th reduced homology group (with real coefficients) of I(G)I(G) is at most {1i1<<ik+1V:λi1+λi2++λik+1V}, \left| \left\{ 1\leq i_1<\cdots<i_{k+1}\leq |V| : \, \lambda_{i_1}+\lambda_{i_2}+\cdots+\lambda_{i_{k+1}} \geq |V|\right\}\right|, where λ1λ2λV=0\lambda_1\geq\lambda_2\geq \cdots\geq \lambda_{|V|}=0 are the eigenvalues of L(G)L(G). In particular, if kk is the minimal number such that the sum of the kk largest eigenvalues of L(G)L(G) is at least V|V|, then H~i(I(G);R)=0\tilde{H}_i(I(G);\mathbb{R})=0 for all ik2i\leq k-2. This extends previous results by Aharoni, Berger and Meshulam. Our proof relies on a relation between the kk-dimensional Laplacian Lk(I(G))L_k(I(G)) and the (k+1)(k+1)-th additive compound matrix of L0(I(G))L_0(I(G)), which is an (nk+1)×(nk+1)\binom{n}{k+1}\times\binom{n}{k+1} matrix whose eigenvalues are all the possible sums of k+1k+1 eigenvalues of the 00-dimensional Laplacian. Our results apply also in the more general setting of vertex-weighted Laplacian matrices.

Keywords

Cite

@article{arxiv.2307.14496,
  title  = {Laplacian eigenvalues of independence complexes via additive compound matrices},
  author = {Alan Lew},
  journal= {arXiv preprint arXiv:2307.14496},
  year   = {2024}
}
R2 v1 2026-06-28T11:41:16.182Z