Related papers: A topological approach to left eigenvalues of quat…
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…
We present detailed computations of the 'at least finite' terms (three dominant orders) of the free energy in a one-cut matrix model with a hard edge a, in beta-ensembles, with any polynomial potential. beta is a positive number, so not…
Ternary paths consist of an up-step of one unit, a down-step of two units, never go below the $x$-axis, and return to the $x$-axis. This paper addresses the enumeration of partial ternary paths, ending at a given level $i$, reading the path…
In noncommutative and nondivision algebra, left spectrum of matrices are less known and is not easy to handle. Split quaternion algebra is a noncommutative and nondivision algebra. In this paper, by the formulas of solving the equations…
We extend previous work on the eigenvalue problem for Hermitian octonionic matrices by discussing the case where the eigenvalues are not real, giving a complete treatment of the 2x2 case, and summarizing some prelimenary results for the 3x3…
We present an explicit formula for the expected value of a product of several independent symplectically invariant matrices in which the trace and real part function may be applied, possibly to different subexpressions. This takes the form…
In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
We prove various results on the cohomology of arithmetic lattices arising from quaternion algebras over a number field with at least one complex place, including a strong restriction on the allowable weights of cuspidal cohomological…
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…
An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
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…
The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and…
We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…