A generalization of the perfect shuffle
The author studies permutations which can be viewed as generalisations of traditional card shuffles. In this case the generalisation consists of separating the cards into several (rather than two) bundles prior to mixing. Some properties of the permutations are proved. Applications to networks and to parallel processing are mentioned.
scientific article; zbMATH DE number 3847390