A lower bound for the second largest up-Laplacian eigenvalue of a simplicial complex
Combinatorics
2026-08-03 v1
Abstract
Let be a finite -dimensional simplicial complex with at least two -faces, and let be its -dimensional up-Laplacian. Writing for the second largest upper degree of a -face, we prove the sharp bound For , this recovers the graph inequality of Li and Pan. We also show that the full graph inequality of Brouwer and Haemers does not extend directly to simplicial complexes: the natural candidate already fails for .
Cite
@article{arxiv.2608.01694,
title = {A lower bound for the second largest up-Laplacian eigenvalue of a simplicial complex},
author = {Vinayak Gupta},
journal= {arXiv preprint arXiv:2608.01694},
year = {2026}
}