Related papers: Polynomial Ensembles and Recurrence Coefficients
We study mesoscopic fluctuations of orthogonal polynomial ensembles on the unit circle. We show that asymptotics of such fluctuations are stable under decaying perturbations of the recurrence coefficients, where the appropriate decay rate…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
We discuss asymptotics of the zeros of orthogonal polynomials on the real line and on the unit circle when the recursion coefficients are periodic. The zeros on or near the absolutely continuous spectrum have a clock structure with spacings…
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials under the condition that the recurrence coefficients in the nearest neighbor recurrence relations converge.
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…
We consider multiple orthogonal polynomials associated with the exponential cubic weight e^{-x^3} over two contours in the complex plane. We study the basic properties of these polynomials, including the Rodrigues formula and…
Ensemble models refer to methods that combine a typically large number of classifiers into a compound prediction. The output of an ensemble method is the result of fitting a base-learning algorithm to a given data set, and obtaining diverse…
We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…
We study averages of multiplicative eigenvalue statistics in ensembles of orthogonal Haar distributed matrices, which can alternatively be written as Toeplitz+Hankel determinants. We obtain new asymptotics for symbols with Fisher-Hartwig…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
We study the characteristic polynomials of both the Gaussian Orthogonal and Symplectic Ensembles. We show that for both ensembles, powers of the absolute value of the characteristic polynomials converge in law to Gaussian multiplicative…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
Our goal is to find asymptotic formulas for orthonormal polynomials $P_{n}(z)$ with the recurrence coefficients slowly stabilizing as $n\to\infty$. To that end, we develop spectral theory of Jacobi operators with long-range coefficients and…
Non-Hermitian random matrices with symplectic symmetry provide examples for Pfaffian point processes in the complex plane. These point processes are characterised by a matrix valued kernel of skew-orthogonal polynomials. We develop their…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
We revisit the classical problem of optimal experimental design (OED) under a new mathematical model grounded in a geometric motivation. Specifically, we introduce models based on elementary symmetric polynomials; these polynomials capture…