A Bijective Proof of Stanley's Shuffling Theorem

DOI10.2307/2000432zbMath0535.05002OpenAlexW4251044112WikidataQ114042870 ScholiaQ114042870MaRDI QIDQ3318780

Ian P. Goulden

Publication date: 1985

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2000432

zbMATH Keywords

permutationssubsequencesshufflesq-binomial coefficientslattice path representations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)

Related Items (12)

Shuffle-compatible permutation statistics ⋮ On a conjecture concerning shuffle-compatible permutation statistics ⋮ Some refinements of Stanley's shuffle theorem ⋮ A new derivation of the generating function for the major index ⋮ Schur-positive sets of permutations via products and grid classes ⋮ The flag major index and group actions on polynomial rings. ⋮ Bijective proofs of shuffle compatibility results ⋮ Cyclic quasi-symmetric functions ⋮ Unnamed Item ⋮ Stanley's shuffling theorem revisited ⋮ \(q\)-hook length formulas for signed labeled forests ⋮ A cyclic analogue of Stanley's shuffling theorem

This page was built for publication: A Bijective Proof of Stanley's Shuffling Theorem