Related papers: A simple counterexample for the permanent-on-top c…

The classical Hermitian eigenvalue problem addresses the following question: What are the possible eigenvalues of the sum A+B of two Hermitian matrices A and B, provided we fix the eigenvalues of A and B. A systematic study of this problem…

In this note we describe the singular locus of diagonally-dominant Hermitian matrices with nonnegative diagonal entries over the reals, the complex numbers, and the quaternions. This yields explicit expressions for the probability that such…

We derive a sufficient condition for a Hermitian $N \times N$ matrix $A$ to have at least $m$ eigenvalues (counting multiplicities) in the interval $(-\epsilon, \epsilon)$. This condition is expressed in terms of the existence of a…

In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…

We develop the Perron-Frobenius theory using a variational approach and extend it to a set of arbitrary matrices, including those that are neither irreducible nor essentially positive, and non-preserved cones. We introduce a new concept…

This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

For a complex polynomial \[ f\left( s\right) =s^{n}+a_{n-1}s^{n-1}+\ldots+a_{1}s+a_{0}% \] and for a rational number $p$, we consider the Schur stability problem of the $p$-th Hadamard power of $f$ \[ f^{\left[ p\right] }\left( s\right)…

Motivated by the conjectures formulated in 2003 by Tun\c{c}el et al., we study interlacing properties of the eigenvalues of $A\otimes B + B\otimes A$ for pairs of $n$-by-$n$ matrices $A, B$. We prove that for every pair of symmetric…

It has recently been observed that the permanent of a non-negative square matrix, i.e., of a square matrix containing only non-negative real entries, can very well be approximated by solving a certain Bethe free energy function minimization…

Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…

We prove a variety of results describing the possible diagonals of tuples of commuting hermitian operators in type $II_1$ factors. These results are generalisations of the classical Schur-Horn theorem to the infinite dimensional,…

Let $M(d,\chi)$ be the moduli space of semistable 1-dimensional sheaves supported at curves of degree $d$ on $\mathbb{P}^2$, with Euler characteristic $\chi$. We have the Hilbert-Chow morphism $\pi: M(d,\chi)\rightarrow |dH|$ sending each…

We study the existence of eigenvalues of the generalized Friedrichs model $H_\mu(p)$, with a rank-one perturbation, depending on parameters $\mu>0$ and $p\in\mathbb{T}^2$, and found an absolutely convergent expansions for eigenvalues at…

We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…

This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…

We report on a computational and experimental study of permanents. On the computational side, we use the GPU to greaatly accelerate the computation of permanents over $\mathbb{C},$ $\mathbb{R},$ $\mathbb{F}_p$ and $\mathbb{Q}.$ First, for…