Related papers: Note on Bounds for Eigenvalues using Traces

We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are particularly…

Consider a deterministic self-adjoint matrix X_n with spectral measure converging to a compactly supported probability measure, the largest and smallest eigenvalues converging to the edges of the limiting measure. We perturb this matrix by…

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Many real-world networks exhibit a high degeneracy at few eigenvalues. We show that a simple transformation of the network's adjacency matrix provides an understanding of the origins of occurrence of high multiplicities in the networks…

We derive bounds on the eigenvalues of saddle-point matrices with singular leading blocks. The technique of proof is based on augmentation. Our bounds depend on the principal angles between the ranges or kernels of the matrix blocks.…

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…

In this paper, we find bounds for the eigenvalues of matrix polynomials. In particular, we find generalizations of Cauchy's classical Theorem for distribution of eigenvalues of matrix polynomial.

In this paper we study the structure and give bounds for the eigenvalues of the $n\times n$ matrix, which $ij$ entry is $(i,j)^\alpha[i,j]^\beta$, where $\alpha,\beta\in\Rset$, $(i,j)$ is the greatest common divisor of $i$ and $j$ and…

We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…

We prove an upper bound on the trace of any 2-positive, trace-preserving map in terms of its smallest eigenvalue. We show that this spectral bound is tight, and that 2-positivity is necessary for this inequality to hold in general.…

We prove the existence of limits of real-analytic Laplace eigenvalue branches for real-analytic families of metrics that degenerate along a compact hypersurface.

Matrix perturbation bounds play an essential role in the design and analysis of spectral algorithms. In this paper, we use a "contour bootstrapping" argument to derive several new perturbation bounds. As applications, we discuss new bounds…

Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…

We consider the 3-dimensional Stark operator perturbed by a complex-valued potential. We obtain an estimate for the number of eigenvalues of this operator as well as for the sum of imaginary parts of eigenvalues situated in the upper…

In this paper we prove complex bounds, also referred to as a priori bounds, for real analytic (and even C3) interval maps. This means that we associate to such a map a complex box mapping (which provides a kind of Markov structure),…

Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction…

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

In 1970 Nosal gave upper and lower bounds on the sum of the spectral radii of a graph and its complement. We generalize this problem to other eigenvalues and give a number of bounds. We essentially solve the corresponding problem for the…

We study, count and locate the exceptional points where eigenvalues collide for certain families of matrices $$R(s,t) = \cos(s \pi / 2)C + \sin(s \pi / 2)U(t), \quad s,t \in [0,1]$$ where $C$ is a realization of a Ginibre random matrix, or…