Related papers: A matrix realization of spectral bounds
We show that the joint spectral radius of a finite collection of nonnegative matrices can be bounded by the eigenvalue of a non-linear operator. This eigenvalue coincides with the ergodic constant of a risk-sensitive control problem, or of…
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\mathcal{F}(\lambda)$ be the family of connected graphs of spectral radius $\le \lambda$. We show that $\mathcal{F}(\lambda)$ can be defined by a finite…
In this paper, we use a new approach to prove that the largest eigenvalue of the sample covariance matrix of a normally distributed vector is bigger than the true largest eigenvalue with probability 1 when the dimension is infinite. We…
The purpose of this paper is to establish universality of the fluctuations of the largest eigenvalue of some non necessarily Gaussian complex Deformed Wigner Ensembles. The real model is also considered. Our approach is close to the one…
In this paper we express the eigenvalues of a sort of real heptadiagonal symmetric matrices as the zeros of explicit rational functions establishing upper and lower bounds for each of them. From these prescribed eigenvalues we compute also…
We compare two established and a new method for the calculation of spectral bounds for Hessian matrices on hyperrectangles by applying them to a large collection of 1522 objective and constraint functions extracted from benchmark global…
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…
We study the question of finding the maximal determinant of matrices of odd order with entries {-1,1}. The most general upper bound on the maximal determinant, due to Barba, can only be achieved when the order is the sum of two consecutive…
The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…
Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.
For a Riemannian closed spin manifold and under some topological assumption (non-zero $\hat{A}$-genus or enlargeability in the sense of Gromov-Lawson), we give an optimal upper bound for the infimum of the scalar curvature in terms of the…
In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…
Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…
The matrix Markov inequality by Ahlswede was stated using the Loewner anti-order between positive definite matrices. Wang use this to derive several other Chebyshev and Chernoff-type inequalities (Hoeffding, Bernstein, empirical Bernstein)…
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…
In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results…