Generalised shuffle groups

DOI10.1007/S11856-021-2194-1MaRDI QIDQ6323651arXivFDO

Authors Carmen Amarra, Luke Morgan, Cheryl E. Praeger

Publication date 14 August 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11856-021-2194-1

Mathematics Subject Classification ID

Group theory and generalizations (20-XX) Permutation groups (20Bxx) Abstract finite groups (20Dxx)

arXiv classification

math.GR

Abstract: The mathematics of shuffling a deck of $2n$ cards with two "perfect shuffles" was brought into clarity by Diaconis, Graham and Kantor. Here we consider a generalisation of this problem, with a so-called "many handed dealer" shuffling $kn$ cards by cutting into $k$ piles with $n$ cards in each pile and using $k!$ shuffles. A conjecture of Medvedoff and Morrison suggests that all possible permutations of the deck of cards are achieved, so long as $keq4$ and $n$ is not a power of $k$. We confirm this conjecture for three doubly infinite families of integers: all $(k,n)$ with $k>n$; all $(k,n)in(el{l}^e,el{l}^f)midellgeqslant2,el{l}^e>4,fmboxnotamultipleofe$; and all $(k,n)$ with $k=2^{e}geqslant4$ and $n$ not a power of $2$. We open up a more general study of shuffle groups, which admit an arbitrary subgroup of shuffles.

This page was built for publication: Generalised shuffle groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323651)