Proof of Lew's conjecture on the spectral gaps of simplicial complexes

Abstract

As a generalization of graph Laplacians to higher dimensions, the combinatorial Laplacians of simplicial complexes have garnered increasing attention. Let X be a simplicial complex on vertex set V of size n, and let X(k) denote the set of all k-dimensional simplices of X. The k-th spectral gap μk(X) is the smallest eigenvalue of the reduced k-dimensional Laplacian of X. For any k≥ -1, Lew [J. Combin. Theory Ser. A 169 (2020) 105127] established a lower bound for μk(X): μk(X)≥ (d+1)(σ∈ X(k)X(σ)+k+1)-dn≥ (d+1)(k+1)-dn, where X(σ) and d denote the degree of σ in X and the maximal dimension of a missing face of X, respectively. In this paper, we identify the unique simplicial complex that achieves the lower bound of the k-th spectral gap, (d+1)(k+1)-dn, for some k, thereby confirming a conjecture proposed by Lew.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…