Seminar | April 2 | 12-1 p.m. | 939 Evans Hall
Persi Diaconis, Stanford University
Parking functions are basic objects of combinatorics. In joint work with Angela Hicks, we ask 'What does a typical parking function look like? What's the chance that $\pi (i)=j$? How about the number of ones or the area $\pi (1)+ ...+\pi (n)$?' These questions lead to new probability (Airey processes) and new results about parking functions. I will try to explain both the combinatorics and the probability 'in English'.