A universality theorem for ratios of random characteristic polynomials

We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a universality limit for these ratios.     

Splitting fields of characteristic polynomials of random elements in arithmetic groups

We discuss rather systematically the principle, implicit in earlier works, that for a “random” element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic polynomial, computed using any faitfhful representation, has Galois group isomorphic to the Weyl group of the underlying algebraic group. Besides tools such as the large sieve, which we had already used, we introduce some probabilistic ideas (large deviation estimates for finite Markov chains) and the general case involves a more precise understanding of the way Frobenius conjugacy classes are computed for such splitting fields (which is related to a map between regular elements of a finite group of Lie type and conjugacy classes in the Weyl group which had been considered earlier by Carter and Fulman for other purposes; we show in particular that the values of this map are equidistributed).     

随机矩阵特征多项式的相关函数的多项式表示

利用正交多项式的性质给出了高斯辛系综中酉辛群上的随机矩阵特征多项式的相关函数和矩的简洁的行列式表示,且行列式的元为正交多项式.     

The characteristic polynomial of a random permutation matrix

We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. We relate this result to a central limit theorem of Wieand for the counting function for the eigenvalues lying in some interval on the unit circle.     

Construction of unital matrix polynomials with mutually distinct characteristic roots

We investigate the construction of unital matrix polynomials with mutually distinct characteristic roots, namely, their similarity and reducibility by the similarity transformation to block-triangular, block-diagonal, and, in particular, to triangular and diagonal forms. We also study the problem of extracting linear factors.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 1, pp. 69–77, January, 1993.     

Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory

We consider asymptotics for orthogonal polynomials with respect to varying exponential weights w_n(x)dx = e^−nV(x) dx on the line as n → ∞. The potentials V are assumed to be real analytic, with sufficient growth at infinity. The principle results concern Plancherel‐Rotach‐type asymptotics for the orthogonal polynomials down to the axis. Using these asymptotics, we then prove universality for a variety of statistical quantities arising in the theory of random matrix models, some of which have been considered recently in [31] and also in [4]. An additional application concerns the asymptotics of the recurrence coefficients and leading coefficients for the orthonormal polynomials (see also [4]). The orthogonal polynomial problem is formulated as a Riemann‐Hilbert problem following [19, 20]. The Riemann‐Hilbert problem is analyzed in turn using the steepest‐descent method introduced in [12] and further developed in [11, 13]. A critical role in our method is played by the equilibrium measure dμ_V for V as analyzed in [8]. © 1999 John Wiley & Sons, Inc.     

First order spectral perturbation theory of square singular matrix polynomials

We develop first order eigenvalue expansions of one-parametric perturbations of square singular matrix polynomials. Although the eigenvalues of a singular matrix polynomial P(λ) are not continuous functions of the entries of the coefficients of the polynomial, we show that for most perturbations they are indeed continuous. Given an eigenvalue λ₀ of P(λ) we prove that, for generic perturbations M(λ) of degree at most the degree of P(λ), the eigenvalues of P(λ)+?M(λ) admit covergent series expansions near λ₀ and we describe the first order term of these expansions in terms of M(λ₀) and certain particular bases of the left and right null spaces of P(λ₀). In the important case of λ₀ being a semisimple eigenvalue of P(λ) any bases of the left and right null spaces of P(λ₀) can be used, and the first order term of the eigenvalue expansions takes a simple form. In this situation we also obtain the limit vector of the associated eigenvector expansions.     

The characteristic polynomial of a random permutation matrix at different points

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show that the behavior at different points is independent in the limit and are asymptotically normal. Our methods enable us to study also the wreath product of permutation matrices and diagonal matrices with i.i.d. entries and more general class functions on the symmetric group with a multiplicative structure.     

Triangularizing matrix polynomials

For an algebraically closed field F$\mathbb{F}$, we show that any matrix polynomial P(λ)∈F[λ]^n×m$P(\lambda )\in \mathbb{F}{[\lambda ]}^{n\times m}$, n?m$n?m$, can be reduced to triangular form, preserving the degree and the finite and infinite elementary divisors. We also characterize the real matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal blocks of sizes 1×1$1\times 1$ and 2×2$2\times 2$. The proofs we present solve the structured inverse problem of building up triangular matrix polynomials starting from lists of elementary divisors.     

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.     

On random algebraic polynomials

This paper provides asymptotic estimates for the expected number of real zeros and -level crossings of a random algebraic polynomial of the form , where are independent standard normal random variables and is a constant independent of . It is shown that these asymptotic estimates are much greater than those for algebraic polynomials of the form .

     

On random interpolation polynomials

Translated from Matematicheskie Zametki, Vol. 52, No. 1, pp. 148–150, July, 1992.     

Zero distribution of random polynomials

We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures and to quantitative results on the expected number of zeros in various sets. In the simplest case of Kac polynomials, given by the linear combinations of monomials with i.i.d. random coefficients, it is well known that under mild assumptions on the coefficients, their zeros are asymptotically uniformly distributed near the unit circumference. We give estimates of the expected discrepancy between the zero counting measure and the normalized arclength on the unit circle. Similar results are established for polynomials with random coefficients spanned by different bases, e.g., by orthogonal polynomials. We show almost sure convergence of the zero counting measures to the corresponding equilibrium measures for associated sets in the plane and quantify this convergence. In our results, random coefficients may be dependent and need not have identical distributions.