Discrete Mathematics & Theoretical Computer Science
Volume 3 n° 1 (1998), pp. 11-32
| author: | Christian Krattenthaler |
|---|---|
| title: | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| keywords: | Stanley's Hook-Content Formula |
| abstract: | 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 jeu de taquin. |
| reference: | Christian Krattenthaler (1998), An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula , Discrete Mathematics and Theoretical Computer Science 3, pp. 11-32 |
| ps.gz-source: | dm030102.ps.gz |
| ps-source: | dm030102.ps |
| pdf-source: | dm030102.pdf |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Mon Apr 12 22:54:59 MET DST 1999 by gustedt