HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Enumeration of the distinct shuffles of permutations

Abstract : 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.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:08:19 AM
Last modification on : Thursday, February 7, 2019 - 5:55:42 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:50:30 AM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads