Combinatorics of dispersionless integrable systems and universality in random matrix theory

Abstract

It is well-known that the partition function of the unitary ensembles of random matrices is given by a tau-function of the Toda lattice hierarchy and those of the orthogonal and symplectic ensembles are tau-functions of the Pfaff lattice hierarchy. In these cases the asymptotic expansions of the free energies given by the logarithm of the partition functions lead to the dispersionless (i.e. continuous) limits for the Toda and Pfaff lattice hierarchies. There is a universality between all three ensembles of random matrices, one consequence of which is that the leading orders of the free energy for large matrices agree. In this paper, this universality, in the case of Gaussian ensembles, is explicitly demonstrated by computing the leading orders of the free energies in the expansions. We also show that the free energy as the solution of the dispersionless Toda lattice hierarchy gives a solution of the dispersionless Pfaff lattice hierarchy, which implies that this universality holds in general for the leading orders of the unitary, orthogonal, and symplectic ensembles. We also find an explicit formula for the two point function Fnm which represents the number of connected ribbon graphs with two vertices of degrees n and m on a sphere. The derivation is based on the Faber polynomials defined on the spectral curve of the dispersionless Toda lattice hierarchy, and 1nm Fnm are the Grunsky coefficients of the Faber polynomials.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…