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

DOI10.1080/03081088408817610zbMATH Open0551.05015OpenAlexW2070687845WikidataQ114100513 ScholiaQ114100513MaRDI QIDQ3344209FDOQ3344209

Authors: Roger Whitney, Jeffrey 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

Recommendations

• Building reverse plane partitions with rim-hook-shaped bricks
• Inserting rim-hooks into reverse plane partitions
• scientific article
• Combinatorial proofs of hook generating functions for skew plane partitions
• Another involution principle-free bijective proof of Stanley's hook-content formula

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)

Cites Work

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

Cited In (21)

• A method for proving polynomial enumeration formulas
• Schützenberger's jeu de taquin and plane partitions
• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• Enumeration of cylindric plane partitions
• Enumeration of lattice paths and generating functions for skew plane partitions
• Binomial determinants, paths, and hook length formulae
• The weighted hook length formula
• Building reverse plane partitions with rim-hook-shaped bricks
• Minuscule reverse plane partitions via quiver representations
• A new proof of a theorem of Littlewood
• Title not available (Why is that?)
• A triple product formula for plane partitions derived from biorthogonal polynomials
• Oscillating tableaux and nonintersecting lattice paths
• Bijections between lattice paths and plane partitions
• Inserting rim-hooks into reverse plane partitions
• Note on enumeration of partitions contained in a given shape
• The combinatorics of Jeff Remmel
• Generating functions for plane partitions of a given shape
• Bijective proofs of some classical partition identities
• Rational generating functions for enumerating chains of partitions
• A combinatorial proof of the Giambelli identity for Schur functions

This page was built for publication: A bijective proof of the generating function for the number of reverse plane partitions via lattice paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344209)