Applications of top to random shuffles

Jason Fulman

University of Pittsburgh

October 3,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

The top to random shuffle is a method of shuffling cards which proceeds at each step by removing the top card and inserting it into a random position. We survey applications of the top to random shuffle to representation theory and combinatorics. Along the way we give an introduction to Stein's method (a remarkable technique for proving probabilistic limit theorems in situtations where exact enumeration fails). Finally, we give a new result on character ratios of symmetric groups. This talk should be accessible to a general audience.


Speaker's Contact Info: fulman(at-sign)math.pitt.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on September 18, 2003 at 11:18 AM. Copyright © 1998-99, Sara C. Billey. All rights reserved.