riffle: Riffle shuffles

In partitions: Additive Partitions of Integers

Riffle shuffles

Description

\loadmathjax

Enumeration of riffle shuffles

Usage

genrif(v)
riffle(p,q=p)

Arguments

p,q,v

In function riffle(), integers p,q specify the length of the two increasing sequences. In function genrif(), the elements of v specify the lengths of all the increasing sequences: there are sum(v) cards in the pack

Details

A riffle shuffle is a permutation of integers \mjeqn1,2,...,n1,2,...,n containing one or two rising sequences.

A generalized riffle shuffle, or \mjseqnr-riffle shuffle, contains at most \mjseqnr rising sequences. This is not implemented in the package (earlier versions included a buggy version; the difficulty is ensuring that sequences do not appear more than once).

• riffle(p,q) returns all riffle shuffles with rising sequences of 1:p and (p+1):q

• genrif(v) returns all riffle shuffles with rising sequences having lengths the entries of v, the deck being numbered consecutively

Value

Returns a matrix of class partition with columns being riffle shuffles

Note

When we say “contains \mjseqnr rising sequences” we generally mean “contains at most \mjseqnr rising sequences”

Author(s)

Robin K. S. Hankin

See Also

parts

partitions documentation built on July 21, 2022, 9:05 a.m.