Applications of symmetric functions to cycle and increasing subsequence structure after shuffles

DOI10.1023/A:1021177012548zbMath1012.05154arXivmath/0102176OpenAlexW1968488771MaRDI QIDQ1862996

Jason Fulman

Publication date: 11 March 2003

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0102176

zbMATH Keywords

card shufflingcycle indexRSKincreasing subsequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items

The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling, On adding a list of numbers (and other one-dependent determinantal processes), Analysis of casino shelf shuffling machines, Separation cutoffs for random walk on irreducible representations, Foulkes characters, Eulerian idempotents, and an amazing matrix, Convergence rates of random walk on irreducible representations of finite groups, A rule of thumb for riffle shuffling, Riffle shuffles of decks with repeated cards, Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems, Carries, shuffling, and symmetric functions, Toeplitz minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hook flag characters and their combinatorics
• The action of \(S_ n\) on the components of the Hodge decomposition of Hochschild homology
• Shifted tableaux and the projective representations of symmetric groups
• From shuffling cards to walking around the building: An introduction to modern Markov chain theory
• Orthogonal idempotents in the descent algebra of \(B_ n\) and applications
• Trailing the dovetail shuffle to its lair
• The combinatorics of biased riffle shuffles
• Counting permutations with given cycle structure and descent set
• Random words, quantum statistics, central limits, random matrices
• Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
• Generalized riffle shuffles and quasisymmetric functions
• The cycle enumerator of unimodal permutations
• Riffle shuffles, cycles, and descents
• Algebraic aspects of increasing subsequences
• The decomposition of Hochschild cohomology and Gerstenhaber operations
• Cycle structure of riffle shuffles
• On representations of the infinite symmetric group
• Riffle shuffles and their associated dynamical systems
• Semisimple orbits of Lie algebras and card-shuffling measures on Coxeter groups
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Descent algebras, hyperplane arrangements, and shuffling cards
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• Shuffling Cards and Stopping Times
• On the distribution of the length of the longest increasing subsequence of random permutations
• On random polynomials over finite fields
• Analysis of Top To Random Shuffles
• Order statistics for decomposable combinatorial structures
• Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• The cyclic structure of unimodal permutations
• On the distributions of the lengths of the longest monotone subsequences in random words
• Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems