English
Related papers

Related papers: Characteristic Polynomials of Complex Random Matri…

200 papers

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…

Classical Analysis and ODEs · Mathematics 2008-11-26 Satoru Odake , Ryu Sasaki

For a restricted class of potentials (harmonic+Gaussian potentials), we express the resolvent integral for the correlation functions of simple traces of powers of complex matrices of size $N$, in term of a determinant; this determinant is…

High Energy Physics - Theory · Physics 2009-11-11 M. C. Bergère

We obtain an extension of the Christoffel--Darboux formula for matrix orthogonal polynomials with a generalized Hankel symmetry, including the Adler-van Moerbeke generalized orthogonal polynomials.

Classical Analysis and ODEs · Mathematics 2014-08-26 Carlos Álvarez-Fernández , Manuel Mañas

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

Symbolic Computation · Computer Science 2016-08-16 Jean-Guillaume Dumas , Clément Pernet , Zhendong Wan

Exact eigenvalue correlation functions are computed for large $N$ hermitian one-matrix models with eigenvalues distributed in two symmetric cuts. An asymptotic form for orthogonal polynomials for arbitrary polynomial potentials that support…

Condensed Matter · Physics 2009-10-30 Nivedita Deo

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

Symbolic Computation · Computer Science 2019-07-31 Yossef Musleh , Éric Schost

The microscopic correlation functions of non-chiral random matrix models with complex eigenvalues are analyzed for a wide class of non-Gaussian measures. In the large-N limit of weak non-Hermiticity, where N is the size of the complex…

High Energy Physics - Theory · Physics 2014-11-18 G. Akemann

We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…

Mathematical Physics · Physics 2007-06-21 I. V. Krasovsky

We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in…

Functional Analysis · Mathematics 2022-11-16 Ángel Chávez , Stephan Ramon Garcia , Jackson Hurley

In this paper we extend the orthogonal polynomials approach for extreme value calculations of Hermitian random matrices, developed by Nadal and Majumdar [1102.0738], to normal random matrices and 2D Coulomb gases in general. Firstly, we…

Mathematical Physics · Physics 2018-03-05 R. Ebrahimi , S. Zohren

We investigate the average characteristic polynomial $\mathbb E\big[\prod_{i=1}^N(z-x_i)\big] $ where the $x_i$'s are real random variables which form a determinantal point process associated to a bounded projection operator. For a subclass…

Probability · Mathematics 2015-01-08 Adrien Hardy

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

Machine Learning · Statistics 2022-12-13 Zhijun Chen , Hayden Schaeffer , Rachel Ward

We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…

Combinatorics · Mathematics 2022-04-05 Jang Soo Kim , Sun-mi Yun

We study expectations of powers and correlation functions for characteristic polynomials of $N \times N$ non-Hermitian random matrices. For the $1$-point and $2$-point correlation function, we obtain several characterizations in terms of…

Mathematical Physics · Physics 2020-06-02 Alfredo Deaño , Nick Simm

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

Classical Analysis and ODEs · Mathematics 2015-01-20 Arno B. J. Kuijlaars

Bleher and Kuijlaars recently showed that the eigenvalue correlations from matrix ensembles with external source can be expressed by means of a kernel built out of special multiple orthogonal polynomials. We derive a Christoffel-Darboux…

Classical Analysis and ODEs · Mathematics 2010-07-29 E. Daems , A. B. J. Kuijlaars

Bleher and Kuijlaars, and Daems and Kuijlaars showed that the correlation functions of the eigenvalues of a random matrix from unitary ensemble with external source can be expressed in terms of the Christoffel-Darboux kernel for multiple…

Complex Variables · Mathematics 2008-09-24 Jinho Baik

In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…

Classical Analysis and ODEs · Mathematics 2026-04-21 Alfredo Deaño , Pablo Román

In this review we summarise recent results for the complex eigenvalues and singular values of finite products of finite size random matrices, their correlation functions and asymptotic limits. The matrices in the product are taken from…

Mathematical Physics · Physics 2015-10-28 Gernot Akemann , Jesper R. Ipsen

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

Symbolic Computation · Computer Science 2021-04-12 Vincent Neiger , Clément Pernet