Related papers: Inertia indices and eigenvalue inequalities for He…
We establish the converse of Weyl's eigenvalue inequality for additive Hermitian perturbations of a Hermitian matrix.
Matrix versions of some basic convexity inequalities are given. Further results on the same topic are proved in the recent papers on arxiv: 1. Hermitian operators and convex functions, 2. A concavity inequality for symmetric norms, 3.…
Cauchy's interlace theorem states that the characteristic polynomial of a symmetric matrix is interlaced by the characteristic polynomial of any principle submatrix. We prove this in two sentences using only the linearity of the…
We study analogues of classical inequalities for the eigenvalues of sums of pseudo-Hermitian matrices.
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
In the last decade, numerous works have investigated several properties of symplectic eigenvalues. Remarkably, the results on symplectic eigenvalues have been found to be analogous to those of eigenvalues of Hermitian matrices with…
We introduce a measure of discrepancy of Hermitian matrices and establish an inequality between the second singular value of a Hermitian matrix and its discrepancy. These results are applied to answer two questions of Fan Chung about graph…
Eigenvalues inequalities involving (log) convex/concav functions and Hermitian matrices, positive unital maps are considered. Simple proofs of Bhatia-Kittaneh inequality and Naimark dilation theorem are given.
We review some convexity inequalities for Hermitian matrices an add one more to the list.
Eigenvalue interlacing is a useful tool in linear algebra and spectral analysis. In its simplest form, the interlacing inequality states that a rank-one positive perturbation shifts each eigenvalue up, but not further than the next…
Symmetrizable matrices are those which are symmetric when multiplied by a diagonal matrix with positive entries. The Cauchy interlace theorem states that the eigenvalues of a real symmetric matrix interlace with those of any principal…
Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of…
Harary and Schwenk posed the problem forty years ago: Which graphs have distinct adjacency eigenvalues? In this paper, we obtain a necessary and sufficient condition for an Hermitian matrix with simple spectral radius and distinct…
We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…
Sylvester's law of inertia states that the number of positive, negative and zero eigenvalues of Hermitian matrices is preserved under congruence transformations. The same is true of generalized Hermitian definite eigenvalue problems, in…
We first describe a system of inequalities (Horn's inequalities) that characterize eigenvalues of sums of Hermitian matrices. When we apply this system for integral Hermitian matrices, one can directly test it by using Littlewood-Richardson…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…