Applications of Symmetric Functions to Cycle and Subsequence Structure after Shuffles
Author:
- Jason FulmanJFJason Fulman
Preprint
Abstract
Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth correspondence. One consequence is a cycle index for riffle shuffles when one deals from the bottom of the deck; conclusions are drawn concerning the distribution of fixed points and the asymptotic distribution of cycle structure. In studying cycle structure of unimodal permutations and their generalizations we are led to an interesting variation of the RSK correspondence. This yields a probabilistic interpretation of a Schur-type function.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Generalized Riffle Shuffles and Quasisymmetric FunctionsAnnals of Combinatorics, 2001
- Applications of the Brauer Complex: Card Shuffling, Permutation Statistics, and Dynamical SystemsJournal of Algebra, 2001
- On the distributions of the lengths of the longest monotone subsequences in random wordsProbability Theory and Related Fields, 2001
- Affine Shuffles, Shuffles with Cuts, the Whitehouse Module, and Patience SortingJournal of Algebra, 2000
- Semisimple Orbits of Lie Algebras and Card-Shuffling Measures on Coxeter GroupsJournal of Algebra, 2000
- On representations of the infinite symmetric groupJournal of Mathematical Sciences, 1999
- The Combinatorics of Biased Riffle ShufflesCombinatorica, 1998
- Riffle shuffles, cycles, and descentsCombinatorica, 1995
- Order statistics for decomposable combinatorial structuresRandom Structures & Algorithms, 1994
- Shifted tableaux and the projective representations of symmetric groupsAdvances in Mathematics, 1989