O ct 1 99 9 Affine shuffles , shuffles with cuts , and patience sorting
نویسنده
چکیده
Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group Sn are different, they both satisfy a convolution property. Strong evidence is given that when the underlying parameter q satisfies gcd(n, q−1) = 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. 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.
منابع مشابه
Affine Shuffles, Shuffles with Cuts, and Patience Sorting
Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group Sn are different, they both satisfy a convolution property. Strong evidence is given that when the underlying parameter q satisfies gcd(n, q−1) = 1, the induced measures on conjugacy classes of the symmetric group coincide. This gives rise to interesting combina...
متن کاملSorting with Complete Networks of Stacks
Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be stored temporarily at nodes (the stacks). Both characterized which permutations are sortable; but complexity of sorting was not an issue. In contrast, give...
متن کاملA Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of “cut and then riffle shuffle”. This allows one to obtain information about the convergence rate of permutation statistics (such as the length of the longest increasing subsequence or position of a given card) under these processes. Similar results are given for affine...
متن کاملPerfect Shuffles and Affine Groups
For positive integers k and n the group of perfect k-shuffles with a deck of kn cards is a subgroup of the symmetric group Skn. The structure of these groups was found for k = 2 by Diaconis, Graham, and Kantor and for k ≥ 3 and a deck of km cards by Medvedoff and Morrison. They also conjectured that for k = 4 and deck size 2m, m odd, the group is isomorphic to the group of affine transformation...
متن کاملClumpy Riffle Shuffles
Sticky or clumpy riffle shuffles appear quite naturally in applications; however, the problem of precisely describing the convergence rate of such modified riffle shuffles has remained open for a long time. In this paper, we develop an alternative family of clumpy shuffles, and analyze their convergence rate. We then provide empirical evidence that our alternative shuffles converge at a similar...
متن کامل