Standard perfect shuffles involve splitting a deck of
cards
into two stacks and interlacing the cards from the stacks. There are two
ways that this interlacing can be done, commonly referred to as an in shuffle
and an out shuffle, respectively. In 1983, Diaconis, Graham, and Kantor
determined the permutation group generated by in and out shuffles on a deck of
cards for
all
.
Diaconis et al. concluded their work by asking whether similar results hold for
so-called generalized perfect shuffles. For these shuffles, we split a deck of
cards
into
stacks and similarly interlace the cards with an in
-shuffle or out
-shuffle, respectively.
In this paper, we find the structure of the group generated by these two shuffles for a deck of
cards, together
with
-shuffles, for all
possible values of
,
,
and .
The group structure is completely determined by
and the
parity of
.
In particular, the group structure is independent of the value of
.
I must complain the cards are ill
shuffled till I have a good hand. — Jonathan Swift
(1667–1745)
Keywords
perfect shuffle, permutation group, symmetric group