Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs
Combinatorics
2023-08-17 v1
Abstract
Let be the simplicial complex whose vertices are the non-trivial subspaces of and whose simplices correspond to families of subspaces forming a flag. Let be the -dimensional weighted upper Laplacian on . The spectrum of was first studied by Garland, who obtained a lower bound on its non-zero eigenvalues. Here, we focus on the case. We determine the asymptotic behavior of the eigenvalues of as tends to infinity. In particular, we show that for large enough , has exactly distinct eigenvalues, and that every eigenvalue of tends to as goes to infinity. This solves the -dimensional case of a conjecture of Papikian.
Keywords
Cite
@article{arxiv.2308.08397,
title = {Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs},
author = {Alan Lew},
journal= {arXiv preprint arXiv:2308.08397},
year = {2023}
}