Carries, Shuffling, and an Amazing Matrix

Authors:
  • PDPersi Diaconis
    Persi Diaconis
  • JFJason Fulman
    Jason Fulman

Abstract
The number of ``carries'' when $n$ 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 $n$ cards is repeatedly riffle shuffled. This gives new results for the statistics of carries and shuffling.

This publication has 18 references indexed in Scilit: