Related papers: An eigenvalue interlacing approach to Garland's me…

The $k$-th token graph of a graph $G=(V,E)$ is the graph $F_k(G)$ whose vertices are the $k$-subsets of $V$ and whose edges are all pairs of $k$-subsets $A,B$ such that the symmetric difference of $A$ and $B$ forms an edge in $G$. Let…

Let $X$ be a simplicial complex. For $1\le i\le\dim(X)$, let $X(i)$ be the set of $i$-dimensional faces of $X$, and let $f_i(X)=|X(i)|$. For $0\le i\le \dim(X)-1$, let $L_i^+(X)$ be the $i$-th upper Laplacian operator of $X$. For $\sigma\in…

This is an expository paper on Garland's vanishing theorem specialized to the case when the linear algebraic group is $\mathrm{SL}_n$. Garland's theorem can be stated as a vanishing of the cohomology groups of certain finite simplicial…

The independence complex of a graph $G=(V,E)$ is the simplicial complex $I(G)$ on vertex set $V$ whose simplices are the independent sets in $G$. We present new lower bounds on the eigenvalues of the $k$-dimensional Laplacian $L_k(I(G))$ in…

Let X(G) denote the flag complex of a graph G=(V,E) on n vertices. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following result: Let \lambda_2(G) denote the second…

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…

Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spectral gaps of the graph Laplacians of the links of faces and…

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…

Let $X$ be a smooth, separated, geometrically connected scheme defined over a number field $K$ and $\{\rho_\lambda\}_\lambda$ a system of n-dimensional semisimple $\lambda$-adic representations of the \'etale fundamental group of $X$ such…

Let $(M^n,g)$ be a closed Riemannian manifold of dimension $n\ge 3$. We study the variational properties of the $k$-th eigenvalue functional $\tilde g\in[g] \mapsto \lambda_k(L_{\tilde g})$ under a non-volume normalization proposed by…

Let $(M,g)$ be a compact $n$-dimensional Riemannian manifold with nonempty boundary and $n\geq 2$. Assume that ${\mathrm{Ric}(M)\ge (n-1)K}$ for some ${K>0}$ and that $\partial M$ has nonnegative mean curvature with respect to the outward…

Let $X$ be a simplicial complex on $n$ vertices without missing faces of dimension larger than $d$. Let $L_{j}$ denote the $j$-Laplacian acting on real $j$-cochains of $X$ and let $\mu_{j}(X)$ denote its minimal eigenvalue. We study the…

Under the lack of variational structure and nondegeneracy, we investigate three notions of \textit{generalized principal eigenvalue} for a general infinity Laplacian operator with gradient and homogeneous term. A Harnack inequality and…

We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…

Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…

We prove the universality of the joint distribution of an eigenvalue and the corresponding diagonal eigenvector overlap, in the bulk and at the edge, for eigenvalues of complex matrices and real eigenvalues of real matrices. As part of the…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…

In this paper, we obtain a new abstract formula relating eigenvalues of a self-adjoint operator to two families of symmetric and skew-symmetric operators and their commutators. This formula generalizes earlier ones obtained by Harrell,…