Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 165 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 39 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 106 tok/s Pro
Kimi K2 185 tok/s Pro
GPT OSS 120B 445 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Laplacian eigenvalues of independence complexes via additive compound matrices (2307.14496v2)

Published 26 Jul 2023 in math.CO

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

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 tweet and received 0 likes.

Upgrade to Pro to view all of the tweets about this paper: