Search arXiv⌕ Search

arXiv · 2508.17279

An eigenvalue interlacing approach to Garland's method

Abstract

Let $X$ be a pure $d$-dimensional simplicial complex. For $0\le k\le d$, let $X(k)$ be the set of $k$-dimensional faces of $X$, let $\tilde{L}_k(X)$ be the $k$-dimensional weighted total Laplacian operator on $X$, and let $\tilde{H}_k(X;\mathbb{R})$ be its $k$-dimensional reduced homology group with real coefficients. For $σ\in X$, let $\text{lk}(X,σ)$ be the link of $σ$ in $X$. For a matrix $M$, we denote by $\text{Spec}(M)$ the multi-set containing all the eigenvalues of $M$. We show that, for every $0\le \ell<k \le d$, \[ \text{dim}(\tilde{H}_k(X;\mathbb{R}))\le \sum_{η\in X(\ell)}\left| \left\{ λ\in \text{Spec}(\tilde{L}_{k-\ell-1}(\text{lk}(X,η))) :\, λ\le \frac{(\ell+1)(d-k)}{k+1}\right\}\right|. \] This extends the classical vanishing theorem of Garland, corresponding to the special case when the right hand side of the inequality is equal to zero, and a more recent result by Hino and Kanazawa, corresponding to the case $\ell=k-1$. A main new ingredient in our proof is an abstract version of Garland's local to global principle, which follows as a simple consequence of the eigenvalue interlacing theorem, and may be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alan Lew. 2025-08-24. An eigenvalue interlacing approach to Garland's method. https://arxiv.org/abs/2508.17279

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗