July 30, 2019
4:00PM - 5:00PM
Scott Lab N050
Add to Calendar
2019-07-30 16:00:00
2019-07-30 17:00:00
What is...? Seminar - James Enouen
Title: What is the Perfect Shuffle?
Speaker: James Enouen (Ohio State University)
Abstract: A standard 52-card deck of playing cards is shuffled "perfectly" when no adjacent card has the same value. The desire to call this type of shuffle "perfect" preys on our tendency to misunderstand and incorrectly generalize probability. In order to answer this question we will begin by studying rook polynomials which describe restrictions of permutations. Finally, we will explore how Ira Gessel's 1988 generalizations of rook polynomials yield means to provide an answer to this difficult combinatorial question.
Seminar URL: http://math.osu.edu/whatis
Scott Lab N050
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2019-07-30 16:00:00
2019-07-30 17:00:00
What is...? Seminar - James Enouen
Title: What is the Perfect Shuffle?
Speaker: James Enouen (Ohio State University)
Abstract: A standard 52-card deck of playing cards is shuffled "perfectly" when no adjacent card has the same value. The desire to call this type of shuffle "perfect" preys on our tendency to misunderstand and incorrectly generalize probability. In order to answer this question we will begin by studying rook polynomials which describe restrictions of permutations. Finally, we will explore how Ira Gessel's 1988 generalizations of rook polynomials yield means to provide an answer to this difficult combinatorial question.
Seminar URL: http://math.osu.edu/whatis
Scott Lab N050
Department of Mathematics
math@osu.edu
America/New_York
public
Title: What is the Perfect Shuffle?
Speaker: James Enouen (Ohio State University)
Abstract: A standard 52-card deck of playing cards is shuffled "perfectly" when no adjacent card has the same value. The desire to call this type of shuffle "perfect" preys on our tendency to misunderstand and incorrectly generalize probability. In order to answer this question we will begin by studying rook polynomials which describe restrictions of permutations. Finally, we will explore how Ira Gessel's 1988 generalizations of rook polynomials yield means to provide an answer to this difficult combinatorial question.
Seminar URL: http://math.osu.edu/whatis
