Random permutations, partitions and PDEs

Ivan Corwin
Columbia University, New York
http://www.math.columbia.edu/~corwin/

Date(s) : 19/03/2019   iCal
14 h 30 min - 15 h 30 min

We start with a seemingly innocuous question — what do large random permutations look like? Focusing on the structure of their “increasing subsequences” we encounter some remarkable mathematics related to symmetric functions (e.g. Schur and Macdonald), random matrices, and stochastic PDEs. No prior knowledge of any of this will be assumed.

Catégories



Retour en haut