Applications of Symmetric Functions to Cycle and Subsequence Structure after Shuffles
Jason Fulman
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.