The Ulam seminar this week will be focused on working through lingering questions from prior problem sessions. As time permits, we will also continue beyond Eli's last lecture in which the definitions of the Chevalley groups were given.
Chevalley Groups: Generators and Relations
Mar. 17, 2022 3pm (Zoom)
Probability
Mei Yin (University of Denver)
X
The topic of parking functions has wide applications in probability, combinatorics, group theory, and computer science. Suppose that m drivers each choose a preferred parking space in a linear car park with n spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function. Through a combinatorial construction termed a parking function multi-shuffle, we investigate various probabilistic properties of a uniform parking function. Partially based on joint work with Richard Kenyon.