Related papers: Multiple eigenvalues
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
The dimensions of certain varieties defined by monomials are computed using only high school algebra.
We show 2 matrices that have identical eigenvalues but different eigenfunctions. This shows that in obtaining two body nuclear matrix elements empirically, it is not sufficient to consider only energy levels. Other quantities like…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
In this article, we show multiple inequalities for the singular values of the difference of matrix means. The obtained results refine and complement some well established results in the literature. Although we target singular values…
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…
This paper is devoted to the study of preservation of eigenvalues, Jordan structure and complementary invariant subspaces of structured matrices under structured perturbations. Perturbations and structure-preserving perturbations are…
For a given polynomial $V(x)\in \mathbb C[x]$, a random matrix eigenvalues measure is a measure $\prod_{1\leq i<j\leq N}(x_i-x_j)^2 \prod_{i=1}^N e^{-V(x_i)}dx_i$ on $\gamma^N$. Hermitian matrices have real eigenvalues $\gamma=\mathbb R$,…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
It is known that singular values of idempotent matrices are either zero or larger or equal to one \cite{HouC63}. We state exactly how many singular values greater than one, equal to one, and equal to zero there are. Moreover, we derive a…
We completely characterize the conditions under which a complex unitary number is an eigenvalue of the non-backtracking matrix of an undirected graph. Further, we provide a closed formula to compute its geometric multiplicity and describe…
We find explicitly the multiplicities in the (mixed) trace cocharacter sequence of two $3\times 3$ matrices over a field of characteristic 0 and show that asymptotically they behave as polynomials of seventh degree. As a consequence we…
It is known that a $2\times 2$ quaternionic matrix has one, two or an infinite number of left eigenvalues, but the available algebraic proofs are difficult to generalize to higher orders. In this paper a different point of view is adopted…
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
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.
Let $F$ be a field, and $\mathcal{M}$ be a linear subspace of $n$-by-$n$ matrices with entries in $F$ that have at most two eigenvalues in $F$ (respectively, at most one non-zero eigenvalue in $F$). In a previous article, we have determined…
The classical methods of multivariate analysis are based on the eigenvalues of one or two sample covariance matrices. In many applications of these methods, for example to high dimensional data, it is natural to consider alternative…
Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…
A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…