Date: Friday, January 24, 2014
Location: 3866 East Hall (4:10 PM to 5:00 PM)
Title: Card Shuffling and other HopfPower Markov Chains
Abstract: The Hopfpower Markov chain is a new way to model the breaking and recombination of combinatorial objects. Its transition probabilities come from the coproductthenproduct operator on a combinatorial Hopf algebra, so it can be analysed using Hopf algebra structure theory. Key examples include the GilbertShannonReeds model of riffleshuffling of a deck of cards, a model of treepruning, and the restrictiontheninduction of representations of the symmetric group. In this talk, I'll give the general definition of these processes, and explain how theorems such as CartierMilnorMoore and PoincareBirkhoffWitt give information about their long term behaviour. This is a generalisation of joint work with Persi Diaconis and Arun Ram. No knowledge of Markov chains will be assumed.
Files:
Speaker: Amy Pang
Institution: Stanford U.
Event Organizer:
