Reverse Plane Partitions Research Articles

The expansion of Hall-Littlewood functions in the dual Grothendieck polynomial basis

A combinatorial expansion of the Hall-Littlewood functions into the Schur basis of symmetric functions was first given by Lascoux and Schützenberger, with their discovery of the charge statistic. A combinatorial expansion of stable Grassmannian Grothendieck polynomials into monomials was first given by Buch, using set-valued tableaux. The dual basis of the stable Grothendieck polynomials was given a combinatorial expansion into monomials by Lam and Pylyavskyy using reverse plane partitions. We generalize charge to set-valued tableaux and use all of these combinatorial ideas to give a nice expansion of Hall-Littlewood polynomials into the dual Grothendieck basis. \par En associant une charge à un tableau, une formule combinatoire donnant le développement des polynômes de Hall-Littlewood en termes des fonctions de Schur a été obtenue par Lascoux et Schützenberger. Une formule combinatoire donnant le développement des polynômes de Grothendieck Grassmanniens stables en termes des fonctions monomiales a quant à elle été obtenue par Buch à l'aide de tableaux à valeurs sur des ensembles. Finalement, une formule faisant intervenir des partitions planaires inverses a été obtenue par Lam et Pylyavskyy pour donner le développement de la base duale aux polynômes de Grothendieck stables en termes de monômes. Nous généralisons le concept de charge aux tableaux à valeurs sur des ensembles et, en nous servant de toutes ces notions combinatoires, nous obtenons une formule élégante donnant le développement des polynômes de Hall-Littlewood en termes de la base de Grothendieck duale.

An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula

A bijective proof for Stanley's hook-content formula for the generating function for column-strict reverse plane partitions of a given shape is given that does not involve the involution principle of Garsia and Milne. It is based on the Hillman-Grassl algorithm and Schützenberger's \emphjeu de taquin.

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

Recently, Hillman and Grassl gave a bijective proof for the generating function for the number of reverse plane partitions of a fixed shape λ. We give another bijective proof for this generating function via completelv different methods. Our bijection depends on a lattice path coding of reverse plane partitions and a new method for constructing bisections out of certain pairs of involutions due to Garsia and Milne.

Tableaux and matrix correspondences

The Robinson-Schensted correspondence, a bijection between nonnegative matrices and pair of tableaux, is investigated. The representation, in the tableau, of the dihedral symmetries of the matrix are derived in a simple manner using a shape-preserving anti-isomorphism of the platic monoid. The Robinson-Schensted correspondence is shown to be equivalent to the Hillman-Grassl bijection between reverse plane partitions and tabloids. A generalized insertion method for the Robinson-Schensted correspondence is obtained.

The Hillman-Grassl correspondence and the enumeration of reverse plane partitions

Hillman and Grassl have devised a correspondence between reverse plane partitions and nonnegative integer arrays of the same shape that allowed them to easily enumerate reverse plane partitions and provided a combinatorial connection between hook lengths and plane partitions. In this work, a collection of properties of this correspondence are presented, including two characterizations that relate this map to the familiar Schensted-Knuth correspondence. These properties are used to derive simple expressions for the generating functions of reverse plane partitions and symmetric reverse plane partitions with respect to sums along the diagonals. Equally general results are obtained for shifted reverse plane partitions using a new type of hook, thereby proving a conjecture of Stanley.

Functions on tableau frames

In a previous paper the authors used an algorithm for a bijection from the set F of all functions with nonnegative integral values defined on a Young tableau frame Φ onto the set E of all reverse plane partitions (rpp) on Φ in their new proof of R.P. Stanley's generating function for rpp. The algorithm gave new and clear combinatorial significance to the hook numbers of Φ as lengths of zigzag paths but left open the question of invariance of the bijection under interchange of the roles of rows and columns. Here this invariance is proved and the bijection is generalized to allow the entries to be in any linearly ordered additive group. The new algorithms involve n-tuples of paths and use the discreteness of the frame to introduce quantum falls or rises in the entries. New light is shed by considering a tableau frame to be a union of certain rectangles and the hook number of a node to be the number of these rectangles containing the node.

Reverse plane partitions and tableau hook numbers

The generating function of R. P. Stanley for reverse plane partitions on a tableau shape is obtained by a direct method that clearly shows the combinatorial significance of the hook numbers for the shape. The process generalizes the hooks into zigzag paths.