Enumeration of the distinct shuffles of permutations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2009

Enumeration of the distinct shuffles of permutations


A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a way that the letters of each original word remain spelled out in their original relative order. Examples of shuffles of the words $1234$ and $5678$ are, for instance, $15236784$ and $51236748$. In this paper, we enumerate the distinct shuffles of two permutations of any two lengths, where the permutations are written as words in the letters $1,2,3,\ldots ,m$ and $1,2,3,\ldots ,n$, respectively.
Fichier principal
Vignette du fichier
dmAK0113.pdf (229.41 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185410 , version 1 (20-08-2015)



Camillia Smith Barnes. Enumeration of the distinct shuffles of permutations. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.155-166, ⟨10.46298/dmtcs.2718⟩. ⟨hal-01185410⟩


129 View
1219 Download



Gmail Facebook Twitter LinkedIn More