Combinatorial proofs of hook generating functions for skew plane partitions (Q688709): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90319-o / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112497496 / rank | |||
Normal rank | |||
Latest revision as of 11:48, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial proofs of hook generating functions for skew plane partitions |
scientific article |
Statements
Combinatorial proofs of hook generating functions for skew plane partitions (English)
0 references
13 April 1994
0 references
\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.
0 references
hook generating function
0 references
plane partitions
0 references
Hillman-Grassl algorithm
0 references
