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.     

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.     

On the equality of two plane partition correspondences

The study of column-strict plane partitions and Young tableax has spawned numerous constructive correspondences. Among these are correspondences found in the work of Bender and Knuth that send one column-strict plane partition to another, causing a specified permutation on the numbers of parts of a given size. Another correspondence, created by Schützenberger to act on standard Young tableaux and defined in an entirely different manner. has intimate connections with the Robinson-Schensted algorithm. In this paper, these correspondences are generalized to skew column-strict plane partitions and certain of their basic properties are considered. In particular, it is shown that the correspondence of Schützenberger can be considered a special case of the Bender-Knuth correspondences.     

Plane overpartitions and cylindric partitions

Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show that plane overpartitions correspond to certain domino tilings and we give some basic properties of this correspondence.     

(<Emphasis Type="Italic">q</Emphasis>,<Emphasis Type="Italic">t</Emphasis>)-Deformations of multivariate hook product formulae

We generalize multivariate hook product formulae for P-partitions. We use Macdonald symmetric functions to prove a (q,t)-deformation of Gansner’s hook product formula for the generating functions of reverse (shifted) plane partitions. (The unshifted case has also been proved by Adachi.) For a d-complete poset, we present a conjectural (q,t)-deformation of Peterson–Proctor’s hook product formula.     

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.     

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.     

Enumeration of lattice paths and generating functions for skew plane partitions

n-dimensional lattice paths not touching the hyperplanesX _i–X _i+1=–1,i=1,2,...,n, are counted by four different statistics, one of which is MacMahon's major index. By a reflection-like proof, heavily relying on Zeilberger's (Discrete Math. 44(1983), 325–326) solution of then-candidate ballot problem, determinantal expressions are obtained. As corollaries the generating functions for skew plane partitions, column-strict skew plane partitions, reverse skew plane plane partitions and column-strict reverse skew plane partitions, respectively, are evaluated, thus establishing partly new results, partly new proofs for known theorems in the theory of plane partitions.     

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.     

Coefficients of Wronskian Hermite polynomials

We study Wronskians of Hermite polynomials labeled by partitions and use the combinatorial concepts of cores and quotients to derive explicit expressions for their coefficients. These coefficients can be expressed in terms of the characters of irreducible representations of the symmetric group, and also in terms of hook lengths. Further, we derive the asymptotic behavior of the Wronskian Hermite polynomials when the length of the core tends to infinity, while fixing the quotient. Via this combinatorial setting, we obtain in a natural way the generalization of the correspondence between Hermite and Laguerre polynomials to Wronskian Hermite polynomials and Wronskians involving Laguerre polynomials. Lastly, we generalize most of our results to polynomials that have zeros on the p-star.     

Self-conjugate partitions with the same disparity

We give a bijection between the set of ordinary partitions and that of self-conjugate partitions with some restrictions. Also, we show the relationship between hook lengths of a self-conjugate partition and its corresponding partition via the bijection. As a corollary, we give new combinatorial interpretations for the Catalan number and the Motzkin number in terms of self-conjugate simultaneous core partitions.     

New hook-content formulas for strict partitions

We introduce the difference operator for functions defined on strict partitions and prove a polynomiality property for a summation involving the hook length and content statistics. As an application, several new hook-content formulas for strict partitions are derived.     

Partitions with fixed largest hook length

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub’s analogue of Euler’s Odd-Distinct partition theorem, derive a generalization in the spirit of Alder’s conjecture, as well as a curious analogue of the first Rogers–Ramanujan identity. Moreover, we obtain a partition theorem that is the counterpart of Euler’s pentagonal number theorem in this setting, and connect it with the Rogers–Fine identity. We conclude with some congruence properties.     

Symmetry distribution between hook length and part length for partitions

It is known that the two statistics on integer partitions “hook length” and “part length” are equidistributed over the set of all partitions of n. We extend this result by proving that the bivariate joint generating function by those two statistics is symmetric. Our method is based on a generating function by a triple statistic much easier to calculate.     

A symmetrical plane partition correspondence

MacMahon conjectured the form of the generating function for symmetrical plane partitions, and as a special case deduced the following theorem. The set of partitions of a number n whose part magnitude and number of parts are both no greater than m is equinumerous with the set of symmetrical plane partitions of 2n whose part magnitude does not exceed 2 and whose largest axis does not exceed m. This theorem, together with a companion theorem for the symmetrical plane partitions of odd numbers, are proved by establishing 1-1 correspondences between the sets of partitions.     

Plane Partitions and Their Pedestal Polynomials

For a linear extension P of a partially ordered set S, we consider a generating multivariate polynomial of certain reverse partitions on S, called P-pedestals. We establish a remarkable property of this polynomial: it does not depend on the choice of P. For S a Young diagram, we show that this polynomial generalizes the hook polynomial.     

The bijection between plane partitions and nonnegative integer matrices

The one-to-one correspondence between the set of plane partitions withr rows andm columns and the set of matrices of nonnegative integers with the same numbers of rows and columns has been constructed. Published in Lietuvos Matematikes Rinkinys, Vol. 35, No. 2, pp. 204–210, April–June, 1995.     

On Principal Hook Length Partitions and Durfee Sizes in Skew Characters

We construct for a given arbitrary skew diagram A{\mathcal A} all partitions ν with maximal principal hook lengths among all partitions with [ν] appearing in [A{\mathcal A}]. Furthermore, we show that these are also partitions with minimal Durfee size. We use this to give the maximal Durfee size for [ν] appearing in [A{\mathcal A}] for the cases when A{\mathcal A} decays into two partitions and for some special cases of A{\mathcal A}. We also deduce necessary conditions for two skew diagrams to represent the same skew character.     

How to determine a partition up to conjugation using multisets of hook lengths

If two partitions are conjugate, their multisets of hook lengths are the same. Then one may wonder whether the multiset of hook lengths of a partition determines a partition up to conjugation. The answer turns out to be no. However, we may add an extra condition under which a given multiset of hook lengths determines a partition uniquely up to conjugation. Herman-Chung, and later Morotti found such a condition. We give an alternative proof of Morotti’s theorem and generalize it.     

Hook Length Polynomials for Plane Forests of a Certain Type

The original motivation for the study of hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show that it can be factored into a product of linear forms. Some other enumerative results on forests are also given.