Student Probability Seminar
Around Ulam's Problem
Speaker: Guillaume Dubach
Location: Warren Weaver Hall 1314
Date: Thursday, October 29, 2015, 2 p.m.
This talk will recall and sketch famous results about the longest increasing subsequence of a random (uniformly chosen) permutation. For this purpose, we shall learn and play a solitaire game, give a probabilistic proof of two elegant hook-formulas, and explain the Robinson-Schensted algorithm, among other things. These tools will give us two different approaches of the same problem, and even allow us to draw some conclusions.