Shuffling with ordered cards
Combinatorics
2010-03-24 v1
Abstract
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of their labels and add them to the shuffled stack. We show how to find stacks of cards invariant and periodic under the shuffling. We also show when gcd(q,k)=1 the possible periods of this shuffling are all divisors of order_k(N-q).
Keywords
Cite
@article{arxiv.1003.4422,
title = {Shuffling with ordered cards},
author = {Steve Butler and Ron Graham},
journal= {arXiv preprint arXiv:1003.4422},
year = {2010}
}
Comments
14 pages, lots of figures