The Cycles of the Multiway Perfect Shuffle Permutation

@article{Ellis2002TheCO,
  title={The Cycles of the Multiway Perfect Shuffle Permutation},
  author={John A. Ellis and Hongbing Fan and Jeffrey Shallit},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2002},
  volume={5},
  pages={169-180}
}
The (k,n)-perfect shuffle, a generalisation of the 2-way perfect shuffle, cuts a deck of kn cards into k equal size decks and interleaves them perfectly with the first card of the last deck at the top, the first card of the second-to-last deck as the second card, and so on. It is formally defined to be the permutation ρk,n : i→ ki (mod kn + 1), i ∈ {1,2… CONTINUE READING