Carries, Shuffling and An Amazing Matrix
Combinatorics
2008-06-24 v1 Probability
Abstract
The number of ``carries'' when random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of cards is repeatedly riffle shuffled. This gives new results for the statistics of carries and shuffling.
Cite
@article{arxiv.0806.3583,
title = {Carries, Shuffling and An Amazing Matrix},
author = {Persi Diaconis and Jason Fulman},
journal= {arXiv preprint arXiv:0806.3583},
year = {2008}
}
Comments
16 pages