Carries, Shuffling and An Amazing Matrix
classification
🧮 math.CO
math.PR
keywords
carrieschainmarkovmatrixshufflingwhenaddedamazing
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.