Related papers: A generalized eigenvector-eigenvalue identity from…
The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion form. We introduce a general scaling…
Eigentrust is a simple and widely used algorithm, which quantifies trust based on the repeated application of an update matrix to a vector of initial trust values. In some cases, however, this procedure is rendered uninformative. Here, we…
Many eigenvalue matrix models possess a peculiar basis of observables which have explicitly calculable averages. This explicit calculability is a stronger feature than ordinary integrability, just like the cases of quadratic and Coulomb…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
We consider the local eigenvalue distribution of large self-adjoint $N\times N$ random matrices $\mathbf{H}=\mathbf{H}^*$ with centered independent entries. In contrast to previous works the matrix of variances $s_{ij} = \mathbb{E}\,…
$\newcommand{\Vector}[1]{\bar{#1}{}}$ $\newcommand{\Basis}[1]{\bar{\bar{#1}}{}}$ $\newcommand{\RC}{{}_*{}^*-}$ Let $\Basis e$ be a basis of vector space $V$ over non-commutative $D$-algebra $A$. Endomorhism $\Vector{\Basis eb}$ of vector…
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…
This paper investigates equivalence of square multivariate polynomial matrices with the determinant being some power of a univariate irreducible polynomial. We first generalized a global-local theorem of Vaserstein. Then we proved these…
A well-known fact in linear algebra is that $A^T A$ is always positive semi-definite for any real matrix $A$. We consider a generalization of this fact via the following decision problem. Given a symbolic product of length $k$, consisting…
We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
We prove trace identities for commutators of operators, which are used to derive sum rules and sharp universal bounds for the eigenvalues of periodic Schroedinger operators and Schroedinger operators on immersed manifolds. In particular, we…
We study bounded and unbounded representations of the $*$-algebra $Q_{n,\lambda}(*)$ generated by $n$ idempotents whose sum equals $\lambda e$ ($\lambda\in{\mathbb C}$, $e$ is the identity).
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
This paper is about analytic properties of single transfer matrices originating from general block-tridiagonal or banded matrices. Such matrices occur in various applications in physics and numerical analysis. The eigenvalues of the…
In this note, we present a generalization of some results concerning the spectral properties of a certain class of block matrices. As applications, we study some of its implications on nonnegative matrices, doubly stochastic matrices and…
We investigate eigenvalue attraction for open quantum systems, biophysical systems, and for Parity-Time symmetric materials. To determine whether an eigenvalue and its complex conjugate of a real matrix attract, we derive expressions for…
We study the angles between the eigenvectors of a random $n\times n$ complex matrix $M$ with density $\propto \mathrm{e}^{-n\operatorname{Tr}V(M^*M)}$ and $x\mapsto V(x^2)$ convex. We prove that for unit eigenvectors…
We study the eigenvalues and the eigenvectors of $N\times N$ structured random matrices of the form $H = W\tilde{H}W+D$ with diagonal matrices $D$ and $W$ and $\tilde{H}$ from the Gaussian Unitary Ensemble. Using the supersymmetry technique…