Stanley's shuffling theorem revisited

DOI10.1006/JCTA.1999.2974zbMath1125.05301OpenAlexW2067612340MaRDI QIDQ1806223

Jonathan D. Stadler

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.2974

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (8)

Shuffle-compatible permutation statistics ⋮ On a conjecture concerning shuffle-compatible permutation statistics ⋮ Some refinements of Stanley's shuffle theorem ⋮ Schur-positive sets of permutations via products and grid classes ⋮ Bijective proofs of shuffle compatibility results ⋮ Cyclic quasi-symmetric functions ⋮ Unnamed Item ⋮ A cyclic analogue of Stanley's shuffling theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the binomial drop polynomial of a poset
• Multicolored Simon Newcomb problems
• A Bijective Proof of Stanley's Shuffling Theorem
• Simon Newcomb’s Problem
• Ordered structures and partitions

This page was built for publication: Stanley's shuffling theorem revisited