Characteristic Polynomials of Random Matrices

Number theorists have studied extensively the connections between the distribution of zeros of the Riemann ζ-function, and of some generalizations, with the statistics of the eigenvalues of large random matrices. It is interesting to compare the average moments of these functions in an interval to their counterpart in random matrices, which are the expectation values of the characteristic polynomials of the matrix. It turns out that these expectation values are quite interesting. For instance, the moments of order 2K scale, for unitary invariant ensembles, as the density of eigenvalues raised to the power K ²; the prefactor turns out to be a universal number, i.e. it is independent of the specific probability distribution. An equivalent behaviour and prefactor had been found, as a conjecture, within number theory. The moments of the characteristic determinants of random matrices are computed here as limits, at coinciding points, of multi-point correlators of determinants. These correlators are in fact universal in Dyson's scaling limit in which the difference between the points goes to zero, the size of the matrix goes to infinity, and their product remains finite. Received: 1 October 1999 / Accepted: 18 May 2000