Affine Shuffles, Shuffles with Cuts, the Whitehouse Module, and Patience Sorting
✍ Scribed by Jason Fulman
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 161 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S are different, they n both satisfy a convolution property. Strong evidence is given that when the Ž . underlying parameter q satisfies gcd n, q y 1 s 1, the induced measures on conjugacy classes of the symmetric group coincide. This gives rise to interesting combinatorics concerning the modular equidistribution by major index of permutations in a given conjugacy class and with a given number of cyclic descents. Using representation theoretic work on the Whitehouse module, a formula is obtained for the cycle structure of a riffle shuffle followed by a cut. It is proved that the use of cuts does not speed up the convergence rate of riffle shuffles to randomness. Generating functions for the first pile size in patience sorting from decks with repeated values are derived. This relates to random matrices.