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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3877193
Language Label Description Also known as
default for all languages
No label defined
    English
    A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
    scientific article; zbMATH DE number 3877193

      Statements

      A bijective proof of the generating function for the number of reverse plane partitions via lattice paths (English)
      0 references
      0 references
      0 references
      1984
      0 references
      reverse plane partitions
      0 references
      weight-preserving bijection
      0 references
      lattice path coding
      0 references
      \textit{R. P. Stanley} [Stud. Appl. Math. 50, 259--279 (1971; Zbl 0225.05012)] proved the formula \(\sum^{\infty}_{n=0}P_{\lambda}(n)q^ n=\prod_{(i,j)\in F_{\lambda}}\cdot 1/(1-q^{h_{i,j}}),\) where \(P_{\lambda}(n)\) is the number of reverse plane partitions (R.P.P.'s) of shape \(\lambda\) and weight n. \textit{A. P. Hillman} and \textit{R. M. Grassl} [J. Comb. Theory, Ser. A 21, 216--221 (1976; Zbl 0341.05008)] gave a weight-preserving bijection between tabloids and R.P.P.'s of the same shape which gave a bijective proof of the above formula. In the present paper the authors give another bijective proof by completely different methods. Their bijection depends on a lattice path coding of R.P.P.'s and a new method for constructing bijections out of certain pairs of involutions due to \textit{A. M. Garsia} and \textit{S. C. Milne} [J. Comb. Theory, Ser. A 31, 289--339 (1981; Zbl 0477.05009)].
      0 references

      Identifiers