The mathematics of perfect shuffles
From MaRDI portal
Publication:1055411
DOI10.1016/0196-8858(83)90009-XzbMath0521.05005WikidataQ56058879 ScholiaQ56058879MaRDI QIDQ1055411
William M. Kantor, Persi Diaconis, Ronald L. Graham
Publication date: 1983
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Permutations, words, matrices (05A05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Related Items
What is a statistical model? (With comments and rejoinder)., Combinatorial game distributions of Steiner systems, Finite self-similar sequences, permutation cycles, and music composition, Statistical enumeration of groups by double cosets, Sports scheduling search space connectivity: a riffle shuffle driven approach, Sorting by shuffling methods and a queue, Compactifications of spaces of Landau-Ginzburg models, The Mathematics of the Flip and Horseshoe Shuffles, Shuffling matrices, Kronecker product and discrete Fourier transform, A look at generalized perfect shuffles, Interview with Jeffrey Shallit, A structured quasi-Arnoldi procedure for model order reduction of second-order systems, In praise (and search) of J. V. Uspensky, Efficient representation of perm groups, Matrix geometric means based on shuffled inductive sequences, Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram, VISUAL AND AUDITORY CUES SIGNIFICANTLY REDUCE HUMAN'S INTRINSIC BIASES WHEN TASKED TO GENERATE A RANDOM NUMBER SEQUENCE, The Word and Conjugacy Problem for Shuffle Groups, Computational complexity and 3-manifolds and zombies, Pattern statistics in faro words and permutations, Generalised shuffle groups, A monster Lie algebra?, New Good's type Kronecker power expansions, Generative magic and designing magic performances with constraint programming, Computing the cycles in the perfect shuffle permutation, From shuffling cards to Artin's conjecture
Cites Work
- A monster Lie algebra?
- Diamond - A sorting method for vector machines
- The universal flip matrix and the generalized faro-shuffle
- The generalized faro shuffle
- Permutations by Cutting and Shuffling
- Kronecker products and shuffle algebra
- Ultracomputers
- Parallel Processing with the Perfect Shuffle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item