Neil O’Connell (Université de Warwick, UK)

Longest increasing subsequences and related topics

vendredi 22 octobre 2010, 11h00 - 12h00

Salle de réunion, espace Turing

How long is the longest increasing subsequence in a random permutation? This is a very interesting problem which was first considered by Ulam in the 1960’s.
It has deep connections with random matrices and representation theory and is now quite well understood thanks to the pioneering work of many authors. I will give an overview of its history, mathematical context and also describe some variations which relate to directed percolation and polymer models.