# Discrete orthogonal polynomial ensembles and the Plancherel measure

### Abstract

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meiner ensemble is related to a two-dimensional directed growth model, and the Charlier ensemble is related to the lengths of weakly increasing subsequences in random words. The Krawtchouk ensemble occurs in connection with zig-zag paths in random domino tilings of the Aztec diamond, and also in a certain simplified directed first-passage percolation model. We use the Charlier ensemble to investigate the asymptotics of weakly increasing subsequences in random words and to prove a conjecture of Tracy and Widom. As a limit of the Meiner ensemble or the Charlier ensemble we obtain the Plancherel measure on partitions, and using this we prove a conjecture of Baik, Deift and Johansson that under the Plancherel measure, the distribution of the lengths of the first $k$ rows in the partition, appropriately scaled, converges to the asymptotic joint distribution for the $k$ largest eigenvalues of a random matrix from the Gaussian Unitary Ensemble. In this problem a certain discrete kernel, which we call the discrete Bessel kernel, plays an important role.

Kurt Johansson