Combinatorial proofs of hook generating functions for skew plane partitions
\textit{A. P. Hillman} and \textit{R. M. Grassl} [J. Comb. Theory, Ser. A 21, 216-221 (1976; Zbl 0341.05008)] gave a combinatorial derivation of the hook generating function for reverse plane partitions, earlier derived algebraically by R. Stanley. Here the author derives one of the two hook generating functions for skew plane partitions using the Hillman-Grassl algorithm; the other is derived by a version of the Schützenberger ``jeu de taquin method of \textit{K. Kadell} (to appear). Similar results and techniques are given for skew shifted plane partitions. Some open questions remain.
- A combinatorial proof of a Weyl type formula for hook Schur polynomials
- Enumeration of lattice paths and generating functions for skew plane partitions
- Generating functions for shifted plane partitions
- Building reverse plane partitions with rim-hook-shaped bricks
- Skew doubled shifted plane partitions: calculus and asymptotics
- Inserting rim-hooks into reverse plane partitions
- Some useful theorems for asymptotic formulas and their applications to skew plane partitions and cylindric partitions
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Enumeration of generalized hook partitions
- scientific article; zbMATH DE number 4089550 (Why is no real title available?)
- Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications
- Skew hook formula for \(d\)-complete posets via equivariant \(K\)-theory
- Schützenberger's jeu de taquin and plane partitions
- Skew hook formula for \(d\)-complete posets via equivariant \(K\)-theory
- (\(q,t\))-deformations of multivariate hook product formulae
- Classification of charge-conserving loop braid representations
This page was built for publication: Combinatorial proofs of hook generating functions for skew plane partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688709)