|Location:||MSRI: Online/Virtual, Simons Auditorium|
Mini-Course: Riemann-Hilbert Problems Application In The Random Matrix Theory
To participate in this seminar, please register HERE.
One of the first achievements of random matrix theory was the orthogonal polynomials method developed by Gaudin and Mehta (1960). It was discovered later by Fokas, Its and Kitaev (1992) that general orthogonal polynomials can be computed via the solution of a Riemann–Hilbert problem. We will review the story of analysis of this Riemann-Hilbert problem, compute the large degree asymptotic of orthogonal polynomials and note the consequences for the random matrix theory. We will follow the book by Bleher and Liechty "Random Matrices and the Six-Vertex Model" (2014).No Notes/Supplements Uploaded