A generalization of the perfect shuffle
type: Item
instance of: scholarly article
title: A generalization of the perfect shuffle
zbMATH Open document ID: 0534.05002
DOI: 10.1016/0012-365X(83)90100-0
author: Christian Ronse
published in: Discrete Mathematics
publication date: 1983-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 3847390
zbMATH Keywords: generalized shuffles
zbMATH Keywords: permutations
zbMATH Keywords: card shuffles
MaRDI profile type: Publication
cites work: Realization of graceful permutation by a shuffle-exchange network
cites work: Kronecker products and shuffle algebra
cites work: Rotator design
cites work: Permutations by Cutting and Shuffling
cites work: Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
cites work: The generalized faro shuffle
cites work: Optimization of Cost and Delay in Cellular Permutation Networks
cites work: Parallel Processing with the Perfect Shuffle
cites work: Dynamic Memories with Enhanced Data Access
cites work: Access and Alignment of Data in an Array Processor
cites work: Q5512231
description: scientific article; zbMATH DE number 3847390