Schützenberger's jeu de taquin and plane partitions
Schützenberger's ``jeu de taquin moves around the parts of a column-strict skew plane partition so as to fill all the holes in the partition. In the present paper the construction is modified so that the assumption of column-strictness is not needed: one is subtracted from each part which moves upwards. Knuth's generalization DELETE on the Robinson-Schensted correspondence is also modified and it is shown that the ``jeu de taquin, DELETE, their modifications, and the Hillman-Grassl mapping are essentially equivalent. The material is also related to methods and results of Bender and Stanley; other results in the paper include a proof of MacMahon's ``box theorem and a generating function for plane partitions with parts of size less than or equal to \(m\) where the parts below row \(r\) form a column-strict plane partition with at most \(c\) columns.
- Combinatorial proofs of hook generating functions for skew plane partitions
- A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
- Schützenberger's jeu de taquin
- The jeu de taquin on the shifted rim hook tableaux
- A symmetry theorem on a modified jeu de taquin
- Building reverse plane partitions with rim-hook-shaped bricks
- A method for proving polynomial enumeration formulas
- Schützenberger's jeu de taquin
- Schur functions, pairing of parentheses, \textit{jeu de taquin} and invariant factors
- Jeu de taquin, uniqueness of rectification and ultradiscrete KP
- Combinatorial proofs of hook generating functions for skew plane partitions
- A bijective proof of Kadell's conjecture on plane partitions
- Another refinement of the Bender-Knuth (ex-)conjecture
This page was built for publication: Schützenberger's jeu de taquin and plane partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961540)