
October 17, 2011
4:30PM
-
5:30PM
University Hall 0014
Add to Calendar
2011-10-17 15:30:00
2011-10-17 16:30:00
Zassenhaus Lecture 1 - Persi Diaconis
Title: Basics of ShufflingSpeaker: Persi Diaconis, Stanford UniversityAbstract: How many times must a deck of cards be shuffled to mix it up? Translating this natural question into mathematics involves a mix of probability and algebra. The algebra leads all over the place (e.g., to Hodge decompositions for Hochschild homology). It also allows a useful answer to the original question: "About seven shuffles suffice." 2011 Zassenhaus Lectures Poster
University Hall 0014
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
2011-10-17 16:30:00
2011-10-17 17:30:00
Zassenhaus Lecture 1 - Persi Diaconis
Title: Basics of ShufflingSpeaker: Persi Diaconis, Stanford UniversityAbstract: How many times must a deck of cards be shuffled to mix it up? Translating this natural question into mathematics involves a mix of probability and algebra. The algebra leads all over the place (e.g., to Hodge decompositions for Hochschild homology). It also allows a useful answer to the original question: "About seven shuffles suffice." 2011 Zassenhaus Lectures Poster
University Hall 0014
America/New_York
public
Title: Basics of Shuffling
Speaker: Persi Diaconis, Stanford University
Abstract: How many times must a deck of cards be shuffled to mix it up? Translating this natural question into mathematics involves a mix of probability and algebra. The algebra leads all over the place (e.g., to Hodge decompositions for Hochschild homology). It also allows a useful answer to the original question: "About seven shuffles suffice."