A bijective proof of the generating function for the number of reverse plane partitions via lattice paths

DOI10.1080/03081088408817610zbMath0551.05015OpenAlexW2070687845WikidataQ114100513 ScholiaQ114100513MaRDI QIDQ3344209

Roger Whitney, Jeffery B. Remmel

Publication date: 1984

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088408817610

zbMATH Keywords

reverse plane partitionslattice path codingweight-preserving bijection

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items

The combinatorics of Jeff Remmel, A combinatorial proof of the Giambelli identity for Schur functions, Enumeration of lattice paths and generating functions for skew plane partitions, Oscillating tableaux and nonintersecting lattice paths, Bijective proofs of some classical partition identities, The weighted hook length formula, Generating functions for plane partitions of a given shape, A new proof of a theorem of Littlewood, A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries, Binomial determinants, paths, and hook length formulae

Cites Work

• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• A Rogers-Ramanujan bijection
• Bijective proofs of some classical partition identities
• Reverse plane partitions and tableau hook numbers
• Bijective proofs of formulae for the number of standard Yound tableaux
• Theory and Application of Plane Partitions. Part 2
• The Hook Graphs of the Symmetric Group