The Mathematics of Shuffling Cards

id: 927439 VIP Open in MaM

By Persi Diaconis, Jason Fulman

Language: English

Category: Ebook - Math/Science/Tech

Categories: Math

Size: 45.9 MiB pdf Files: 1

Uploader: draino

Uploaded At: 2023-04-27 08:20:10

American Mathematical Society; 2023, Mathematics, Playing Cards, Card Shuffling

Description


This book gives a lively development of the mathematics needed to answer the question, “How many times should a deck of cards be shuffled to mix it up?” The shuffles studied are the usual ones that real people use: riffle, overhand, and smooshing cards around on the table.

The mathematics ranges from probability (Markov chains) to combinatorics (symmetric function theory) to algebra (Hopf algebras). There are applications to magic tricks and gambling along with a careful comparison of the mathematics to the results of real people shuffling real cards. The book explores links between shuffling and higher mathematics—Lie theory, algebraic topology, the geometry of hyperplane arrangements, stochastic calculus, number theory, and more. It offers a useful springboard for seeing how probability theory is applied and leads to many corners of advanced mathematics.

The book can serve as a text for an upper division course in mathematics, statistics, or computer science departments and will be appreciated by graduate students and researchers in mathematics, statistics, and computer science, as well as magicians and people with a strong background in mathematics who are interested in games that use playing cards.


Readership

Graduate students and researchers interested in applications of mathematics to card shuffling.


Table of Contents

  1. Shuffling cards: An introduction
  2. Practice and history of shuffling cards
  3. Convergence rates for riffle shuffles
  4. Features
  5. Eigenvectors and Hopf algebras
  6. Shuffling and carries
  7. Different models for riffle shuffling
  8. Move-to-front shuffling and variations
  9. Shuffling and geometry
  10. Shuffling and algebraic topology
  11. Type B shuffles and shelf-shuffling machines
  12. Descent algebras, P -partitions, and quasisymmetric functions
  13. Overhand shuffling
  14. “Smoosh” shuffle
  15. How to shuffle perfectly (randomly)
  16. Applications to magic tricks, traffic merging, and statistics
  17. Shuffling and multiple zeta values

Other Torrents