Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T15:16:51.567Z Has data issue: false hasContentIssue false

A complete classification of shuffle groups

Published online by Cambridge University Press:  04 December 2024

Binzhou Xia
Affiliation:
School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC, 3010, Australia; E-mail: binzhoux@unimelb.edu.au
Junyang Zhang
Affiliation:
School of Mathematical Sciences, Chongqing Normal University, Chongqing, 401331, P. R. China; E-mail: jyzhang@cqnu.edu.cn
Zhishuo Zhang*
Affiliation:
School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC, 3010, Australia;
Wenying Zhu
Affiliation:
School of Mathematical Sciences, and Hebei Center for Applied Mathematics, Hebei Normal University, Shijiazhuang, 050024, P. R. China; E-mail: zfwenying@mail.bnu.edu.cn
*
E-mail: zhishuoz@student.unimelb.edu.au (corresponding author)

Abstract

For positive integers k and n, the shuffle group $G_{k,kn}$ is generated by the $k!$ permutations of a deck of $kn$ cards performed by cutting the deck into k piles with n cards in each pile, and then perfectly interleaving these cards following a certain permutation of the k piles. For $k=2$, the shuffle group $G_{2,2n}$ was determined by Diaconis, Graham and Kantor in 1983. The Shuffle Group Conjecture states that, for general k, the shuffle group $G_{k,kn}$ contains $\mathrm {A}_{kn}$ whenever $k\notin \{2,4\}$ and n is not a power of k. In particular, the conjecture in the case $k=3$ was posed by Medvedoff and Morrison in 1987. The only values of k for which the Shuffle Group Conjecture has been confirmed so far are powers of $2$, due to recent work of Amarra, Morgan and Praeger based on Classification of Finite Simple Groups. In this paper, we confirm the Shuffle Group Conjecture for all cases using results on $2$-transitive groups and elements of large fixed point ratio in primitive groups.

MSC classification

Information

Type
Algebra
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press
Figure 0

Figure 1Cut the deck.

Figure 1

Figure 2Out-shuffle.

Figure 2

Figure 3In-shuffle.