A Note on Convergence of Moments for Random Young Tableaux

نویسنده

  • Harold Widom
چکیده

In recent work of Baik, Deift and Rains convergence of moments was established for the limiting joint distribution of the lengths of the first k rows in random Young tableaux. The main difficulty was obtaining a good estimate for the “tail” of the distribution and this was accomplished through a highly nontrival Riemann-Hilbert analysis. Here we give a simpler derivation. A conjecture is stated which, if true, could allow the same method to be applied to certain random growth models. Since the paper of Baik, Deift and Johansson [1] in which the authors determined the limiting distribution for the length of the longest increasing subsequence in a random permutation, or equivalently the length λ1 of the first row in a random Young tableau, there have been a variety of extensions and generalizations. In [2] the same authors determined the limiting distribution of the length λ2 of the second row and Borodin, Okounkov and Olshansky in [4] and Johansson in [7] determined the limit of the joint distribution of λ1, · · · , λk for any k. The result was that for fixed x1, · · · , xk the limit lim N→∞ Pr ( λi ≤ 2 √ N + xi N , i = 1, · · · , k ) exists and equals the limiting joint distribution of the largest k eigenvalues in the Gaussian unitary ensemble of random matrices. (Here N was the number of boxes in the Young tableaux, which were given the Plancherel measure.) In the end it turned out to be the question of the asymptotics of certain Fredholm determinants, and their derivatives, associated with the operator Sn (we use the notation of [2]) acting on l(n, n+ 1, · · ·) whose matrix entries are given by Sn(j, k) = ∞

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Convergence of Moments for Random Young Tableaux and a Random Growth Model

In recent work of Baik, Deift and Rains convergence of moments was established for the limiting joint distribution of the lengths of the first k rows in random Young tableaux. The main difficulty was obtaining a good estimate for the tail of the distribution and this was accomplished through a highly nontrival Riemann-Hilbert analysis. Here we give a simpler derivation. The same method is used ...

متن کامل

A Fredholm Determinant Identity and the Convergence of Moments for Random Young Tableaux

We obtain an identity between Fredholm determinants of two kinds of operators, one acting on functions on the unit circle and the other acting on functions on a subset of the integers. This identity is a generalization of an identity between a Toeplitz determinant and a Fredholm determinant that has appeared in the random permutation context. Using this identity, we prove, in particular, conver...

متن کامل

Truncations of a Random Unitary Matrix and Young Tableaux

Abstract. Let U be a matrix chosen randomly, with respect to Haar measure, from the unitary group U(d). We express the moments of the trace of any submatrix of U as a sum over partitions whose terms count certain standard and semistandard Young tableaux. Using this combinatorial interpretation, we obtain a simple closed form for the moments of an individual entry of a random unitary matrix and ...

متن کامل

Truncations of Random Unitary Matrices and Young Tableaux

Let U be a matrix chosen randomly, with respect to Haar measure, from the unitary group U(d). For any k ≤ d, and any k × k submatrix Uk of U, we express the average value of |Tr(Uk)| as a sum over partitions of n with at most k rows whose terms count certain standard and semistandard Young tableaux. We combine our formula with a variant of the Colour-Flavour Transformation of lattice gauge theo...

متن کامل

Increasing Subsequences and the Classical Groups

We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we show that the 2n-th moment of the trace of a random k-dimensional unitary matrix is equal to the number of permutations of length n with no increasing subsequence of length greater than k. We then generalize this to ot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001