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 \emphje...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
1998-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/258/pdf |
| _version_ | 1827323957807677440 |
|---|---|
| author | Christian Krattenthaler |
| author_facet | Christian Krattenthaler |
| author_sort | Christian Krattenthaler |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T02:01:01Z |
| format | Article |
| id | doaj.art-c0c3478a3df648c7b88571e27711b15a |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:01:01Z |
| publishDate | 1998-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-c0c3478a3df648c7b88571e27711b15a2024-03-07T15:00:47ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80501998-01-01Vol. 3 no. 110.46298/dmtcs.258258An Involution Principle-Free Bijective Proof of Stanley's Hook-Content FormulaChristian Krattenthaler0Fakultät für Mathematik [Wien]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.https://dmtcs.episciences.org/258/pdfstanley's hook-content formula[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Christian Krattenthaler An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula Discrete Mathematics & Theoretical Computer Science stanley's hook-content formula [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| title_full | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| title_fullStr | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| title_full_unstemmed | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| title_short | An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula |
| title_sort | involution principle free bijective proof of stanley s hook content formula |
| topic | stanley's hook-content formula [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/258/pdf |
| work_keys_str_mv | AT christiankrattenthaler aninvolutionprinciplefreebijectiveproofofstanleyshookcontentformula AT christiankrattenthaler involutionprinciplefreebijectiveproofofstanleyshookcontentformula |