Related papers: Eigenvalues and eigenfunctions of a Hamming ball
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…
To each of the Johnson, Grassmann and Hamming graphs we associate a lattice and characterize the eigenspaces of the adjacency operator in terms of this lattice . We also show that each level of the lattice induces in a natural way a tight…
In this note we compute the functional derivative of the induced charge density, on a thin conductor, consisting of the union of g+1 disjoint intervals, $J:=\cup_{j=1}^{g+1}(a_j,b_j),$ with respect to an external potential. In the context…
In this paper we discuss some relations between the eigenvalues and the diagonal entries of Hermitian matrices.
This paper discusses certain properties of heterogeneous hypergeometric functions with two matrix arguments. These functions are newly defined but have already appeared in statistical literature and are useful when dealing with the…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…
This note shows that an interesting property arises when considering the relation between the hypersphere volumes at dimensions $n+1$ and $n$, if the hyperspheres circumscribe unitary hypercubes in $n+1$ and $n$ dimensions, respectively .…
Given a compact surface with boundary, we introduce a family of functionals on the space of its Riemannian metrics, defined via eigenvalues of a Steklov-type problem. We prove that each such functional is uniformly bounded from above, and…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our…
In this article we will explore Dirichlet Laplace eigenvalues on balls on spherically symmetric manifolds. We will compare any Dirichlet Laplace eigenvalue with the corresponding Dirichlet Laplace eigenvalue on balls in Euclidean space with…
This note is about uniform, plane, singly connected, regular Hall-plates with an arbitrary number of contacts exposed to a uniform magnetic field of arbitrary strength. In practice, the regular symmetry is the most common one. If the…
We consider a variant of the classic Steklov eigenvalue problem, which arises in the study of the best trace constant for functions in Sobolev space. We prove that the elementary symmetric functions of the eigenvalues depend…
We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…
The present paper is a follow up of our paper \cite{nS}. We investigate here the maximization of higher order eigenvalues in a conformal class on a smooth compact boundaryless Riemannian surface. Contrary to the case of the first nontrivial…
Eigenvalues are defined for any element of an algebra of observables and do not require a representation in terms of wave functions or density matrices. A systematic algebraic derivation based on moments is presented here for the harmonic…
We consider a class of eigenvalue problems for poly-harmonic operators, including Dirichlet and buckling-type eigenvalue problems. We prove an analyticity result for the dependence of the symmetric functions of the eigenvalues upon domain…
We study functions defined on the vertices of the Hamming graphs $H(n,q)$. The adjacency matrix of $H(n,q)$ has $n+1$ distinct eigenvalues $n(q-1)-q\cdot i$ with corresponding eigenspaces $U_{i}(n,q)$ for $0\leq i\leq n$. In this work, we…
A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…