Hyperplane arrangements and random walks -
How many times do you need to shuffle a deck of cards to ensure it is adequately mixed? In this talk, I will describe a general framework to answer this question: the theory of random walks on hyperplane arrangements. Beyond probabilistic motivations, such random walks (sometimes called shuffling operators) have many beautiful connections to combinatorics, representation theory, and topology.
Thursday, March 5, 2020 at 4:40pm to 5:30pm
Eliot Hall, 314
3203 Southeast Woodstock Boulevard, Portland, Oregon 97202-8199
Reed Community Members
If you are a member of the Reed community, you MUST LOG IN to see events that are open ONLY to the Reed community. Log in with your Reed ID (your Kerberos account information). If you don’t remember your account username or password, go to reed.edu/cis/help/kerberos.html.Log in with Reed ID