Related papers: Spectral scales and linear pencils
For a Lie algebra ${\mathcal L}$ with basis $\{x_1,x_2,\cdots,x_n\}$, its associated characteristic polynomial $Q_{{\mathcal L}}(z)$ is the determinant of the linear pencil $z_0I+z_1\text{ad} x_1+\cdots +z_n\text{ad} x_n.$ This paper shows…
Given a circulant matrix $\mathrm{circ}(c,a,0,0,...,0,a)$, $a\ne 0$, of order~$n$, we ``border'' it from left and from above by constant column and row, respectively, and we set the left top entry to be $-nc$. This way we get a~particular…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
We prove the following for a bounded convex planar domain that is symmetric with respect to both coordinate axes. Consider a centered rectangle with sides parallel to the axes that strictly contains the domain. If the domain is not a…
Let $A_1, \ldots, A_r$ be Hermitian $n \times n$ matrices and $S = \sum A_i \otimes s_i$ the associated matrix semicircle, where $s_1, \ldots, s_r$ are free semicircular variables. We prove that the following are equivalent: (i) the matrix…
The distribution of the eigenvalues of a Hermitian matrix (or of a Hermitian matrix pencil) reveals important features of the underlying problem, whether a Hamiltonian system in physics, or a social network in behavioral sciences. However,…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…
We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.
Suppose that c is an operator on a Hilbert Space H such that the von Neumann algebra N generated by c is finite. Suppose that tau is a faithful normal tracial state on N. Let B denote the spectal scale of c with respect to tau. We show that…
We analyse how the spectrum of the anisotropic Maxwell system with bounded conductivity on a Lipschitz domain is approximated by domain truncation. First we prove a new non-convex enclosure for the spectrum of the Maxwell system, with weak…
We analyze the spectral properties of large, time-lagged correlation matrices using the tools of random matrix theory. We compare predictions of the one-dimensional spectra, based on approaches already proposed in the literature. Employing…
We consider finite pencils of Jacobi matrices \[ J_n(w)=A+wB, \] where $A$ is diagonal and $B$ is tridiagonal with zero diagonal. The spectral curve is the affine plane curve \[ \chi_n(\lambda,w)=\det(\lambda I+J_n(w))=0 . \] The main…
We present a model for spectral theory of families of selfadjoint operators, and their corresponding unitary one-parameter groups (acting in Hilbert space.) The models allow for a scale of complexity, indexed by the natural numbers…
The Spectral Problem is to describe possible spectra $\sigma (A_j)$ for an irreducible $n$-tuple of Hermitian operators s.t. $A_1+...+A_n$ is a scalar operator. In case when $m_j= | \sigma (A_j)|$ are finite and a rooted tree ${\rm…
The notion of a spectral geometry on a compact metric space X is introduced. This notion serves as a discrete approximation of X motivated by the notion of a spectral triple from non-commutative geometry. A set of axioms charaterising…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…
It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…
The stated paper is dedicated to one of the inverse problems of spectral theory. It is necessary to define matrix (constant) coefficients of some quadratic pencil, if the eigenvalues of this pencil are known. Furthermore, it is known that…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…