Title: Lengths of Monotone Subsequences in a Mallows Permutation
Speaker: Nayantara Bhatnagar (University of Delaware)
Date: 05 January 2015
Time: 2:00 pm
Venue: LH-1, Department of Mathematics, IISc
The longest increasing subsequence (LIS) of a uniformly random permutation is a well studied problem. Vershik-Kerov and Logan-Shepp first showed that asymptotically the typical length of the LIS is 2sqrt(n). This line of research culminated in the work of Baik-Deift-Johansson who related this length to the Tracy-Widom distribution.