Related papers: On bounds of matrix eigenvalues
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…
We provide non-asymptotic, relative deviation bounds for the eigenvalues of empirical covariance and Gram matrices in general settings. Unlike typical uniform bounds, which may fail to capture the behavior of smaller eigenvalues, our…
This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…
We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.
We give upper bounds on the order of the automorphism group of a simple graph
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
We show how $\ell$-ifications, which are companion forms of matrix polynomials, namely, lower order matrix polynomials with the same eigenvalues as a given complex square matrix polynomial, can be used in combination with other recent…
We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…
In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…
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 present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of…
The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…
In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an $n$-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine…
We derive some inequalities involving first four central moments of discrete and continuous distributions. Bounds for the eigenvalues and spread of a matrix are obtained when all its eigenvalues are real. Likewise, we discuss bounds for the…
In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are…
The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.
We prove quadratic eigenvalue perturbation bounds for generalized Hermitian eigenvalue problems. The bounds are proportional to the square of the norm of the perturbation matrices divided by the gap between the spectrums. Using the results…
We address overcrowding estimates for the singular values of random iid matrices, as well as for the eigenvalues of random Wigner matrices. We show evidence of long range separation under arbitrary perturbation even in matrices of discrete…