Student Probability Seminar
Longest Increasing Subsequence and Determinantal Point Process
Speaker: Mihai Nica
Location: Warren Weaver Hall 805
Date: Tuesday, April 22, 2014, noon
One route to the solution to understanding the length of the longest increasing subsequence of a random permutation is to introduce some additional structure of many points so that the length is the "topmost" point. In this talk I will briefly introduce two ingredients: The Lindstrom-Gessel-Viennot theorem, and the Robinson-Schensted-Knuth correspondence, and then combine them to show how a random permutation can be associated to a determinantal point process whose topmost point encodes the length of the longest increasing subsequence.