Generalised shuffle groups

Amarra, Carmen; Morgan, Luke; Praeger, Cheryl E.

doi:10.1007/s11856-021-2194-1

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…interlacing patterns of the m stacks rather than restricting to the in and out m-shuffles. The groups generated in this broader context have been discovered for several infinite families [1,10].…”

Section: Introductionmentioning

confidence: 99%

A look at generalized perfect shuffles

Johnson,

Manny,

Van Cott

et al. 2020

Preprint

View full text Add to dashboard Cite

Standard perfect shuffles involve splitting a deck of 2n 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 2n cards for all n. Diaconis et al. concluded their work by asking whether similar results can be found for so-called generalized perfect shuffles. For these new shuffles, we split a deck of mn cards into m stacks and similarly interlace the cards with an in m-shuffle or out m-shuffle (denoted Im and Om, respectively). In this paper, we find the structure of the group generated by these two shuffles for a deck of m k cards, together with m y -shuffles, for all possible values of m, k, and y. The group structure is completely determined by k/ gcd(y, k) and the parity of y/ gcd(y, k). In particular, the group structure is independent of the value of m.

show abstract

Section: Introductionmentioning

confidence: 99%