Applications of Symmetric Functions to Cycle and Increasing Subsequence Structure after Shuffles (Part 2)
Jason Fulman
Abstract
Using the Berele/Remmel/Kerov/Vershik variation of the Robinson-Schensted-Knuth correspondence, we study the cycle and increasing subsequence structure after various methods of shuffling. One consequence is a cycle index for shuffles like: cut a deck into roughly two equal piles, thoroughly mix the first pile and then riffle it with the second pile. Conclusions are drawn concerning the distribution of fixed points and the asymptotic distribution of cycle structure. An upper bound on the convergence rate is given. Connections are made with extended Schur functions and with work of Baik and Rains.
Create a lesson
Related papers
Decay-Ramsey Sequences
Francesco Di Braccio, Simon Griffiths, Pedram Noohi et al.
Hypergraphs with the smallest Hall ratio are still hard to colour
Veronica Bitonti, Freddie Illingworth, Pedram Noohi et al.
The k-color poset Ramsey number of the diamond is 2k
Tom Bohman, Will Cong, Quentin Dubroff et al.
Intersecting families of loose spanning hypertrees
Yury Person, Thomas Schweser
The terminal leave in random greedy hypergraph matching
Peter Keevash
Two Perfect One-Factorizations of K92
Tomasz Maciosowski