Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs

Abstract

Let Fln,q be the simplicial complex whose vertices are the non-trivial subspaces of Fqn and whose simplices correspond to families of subspaces forming a flag. Let +k(Fln,q) be the k-dimensional weighted upper Laplacian on Fln,q. The spectrum of +k(Fln,q) was first studied by Garland, who obtained a lower bound on its non-zero eigenvalues. Here, we focus on the k=0 case. We determine the asymptotic behavior of the eigenvalues of 0+(Fln,q) as q tends to infinity. In particular, we show that for large enough q, 0+(Fln,q) has exactly n2/4+2 distinct eigenvalues, and that every eigenvalue λ≠ 0,n-1 of 0+(Fln,q) tends to n-2 as q goes to infinity. This solves the 0-dimensional case of a conjecture of Papikian.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…