homepeoplearchive

MIT Combinatorics Seminar

Determinantal and Pfaffian Processes


Eric Rains, UC Davis

Friday, February 17, 2006   4:30 pm    Room 2-105

ABSTRACT

In the theory of random matrices, and in the study of various related combinatorial problems, one of the key tools is the fact that certain probabilities of interest have a determinantal structure. One of the most general results along those lines is the Eynard-Mehta theorem; I'll discuss some recent work with Borodin giving a simple proof of this theorem using only linear algebra, and discuss its application to a certain growth model (the Schur process). I'll also discuss pfaffian versions (typically arising from symmetry conditions).