A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences
A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences
Abstract The discrete distribution of the length of longest increasing subsequences in random permutations of n integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of the distribution of the scaled largest level of the large matrix limit …