Orateur: Maxime Gagnebin
Titre: The longest increasing subsequence.
Résumé: This talk will be an introduction in the study of random permutations. We will look more closely at the longest increasing subsequence that we can find in them. After giving the basic definitions of the model, we will see some easy proofs and nice links with some seemingly unrelated fields.

---