Carries, Shuffling and An Amazing Matrix

Simple item page
dc.creatorDiaconis, Persi
dc.creatorFulman, Jason
dc.date2008-06-22
dc.date.accessioned2026-07-07T09:46:06Z
dc.date.available2026-07-07T09:46:06Z
dc.descriptionThe 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/0806.3583
dc.identifierhttp://arxiv.org/abs/0806.3583
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163414
dc.subjectCombinatorics
dc.subjectProbability
dc.titleCarries, Shuffling and An Amazing Matrix
dc.typetext

Files

Collections

arXiv