Applications of Symmetric Functions to Cycle and Increasing Subsequence Structure after Shuffles

Authors:
Jason Fulman
Affiliations:
Department of Mathematics, University of Pittsburgh, 301 Thackeray Hall, Pittsburgh, PA 15260, USA.
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2002

Citing 4
Cited 1

The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm

SIAM Journal on Algebraic and Discrete Methods
Enumerative combinatorics

Enumerative combinatorics
Counting permutations with given cycle structure and descent set

Journal of Combinatorial Theory Series A
The cyclic structure of unimodal permutations

Discrete Mathematics

Foulkes characters, Eulerian idempotents, and an amazing matrix

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after iterations of various shuffling methods. We emphasize the role of Cauchy type identities and variations of the Robinson-Schensted-Knuth correspondence.