Related papers: Left eigenvalues of $2\times 2$ symplectic matrice…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We study the variance and the Laplace transform of the probability law of linear eigenvalue statistics of unitary invariant Matrix Models of n-dimentional Hermitian matrices as n tends to infinity. Assuming that the test function of…
It is shown that max-preserving maps (or join-morphisms) on the positive orthant in Euclidean $n$-space endowed with the component-wise partial order give rise to a semiring. This semiring admits a closure operation for maps that generate…
A classical aspect of Riemannian geometry is the study of estimates that hold uniformly over some class of metrics. The best known examples are eigenvalue bounds under curvature assumptions. In this paper, we study the family of all…
We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…
We study multiplicative statistics for the eigenvalues of unitarily-invariant Hermitian random matrix models. We consider one-cut regular polynomial potentials and a large class of multiplicative statistics. We show that in the large matrix…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to compute the means of these eigenvalues with high precision. Our…
We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
There are four division algebras over $\mathbb{R}$, namely real numbers, complex numbers, quaternions, and octonions. Lack of commutativity and associativity make it difficult to investigate algebraic and geometric properties of octonions.…
We solve the complex extension of the chiral Gaussian Symplectic Ensemble, defined as a Gaussian two-matrix model of chiral non-Hermitian quaternion real matrices. This leads to the appearance of Laguerre polynomials in the complex plane…
In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…
An extension of the finite and infinite Lie groups properties of complex numbers and functions of complex variable is proposed. This extension is performed exploiting hypercomplex number systems that follow the elementary algebra rules. In…
In this paper, we obtain a new abstract formula relating eigenvalues of a self-adjoint operator to two families of symmetric and skew-symmetric operators and their commutators. This formula generalizes earlier ones obtained by Harrell,…
We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…
We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposition of an arbitrary matrix into a product of a symplectic…
We derive computable formulas for the structured backward errors of a complex number $\lambda$ when considered as an approximate eigenvalue of rational matrix polynomials that carry a symmetry structure. We consider symmetric,…
The determination of the density functions for products of random elements from specified classes of matrices is a basic problem in random matrix theory and is also of interest in theoretical physics. For connected simple Lie groups of…