Another involution principle-free bijective proof of Stanley's hook-content formula
| dc.creator | Krattenthaler, Christian | |
| dc.date | 1998-07-13 | |
| dc.date.accessioned | 2026-07-07T05:25:23Z | |
| dc.date.available | 2026-07-07T05:25:23Z | |
| dc.description | Another bijective proof of Stanley's hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and Milne. It is the result of a merge of the modified jeu de taquin idea from the author's previous bijective proof (``An involution principle-free bijective proof of Stanley's hook-content formula", Discrete Math. Theoret. Computer Science, to appear) and the Novelli-Pak-Stoyanovskii bijection (Discrete Math. Theoret. Computer Science 1 (1997), 53-67) for the hook formula for standard Young tableaux of a given shape. This new algorithm can also be used as an algorithm for the random generation of tableaux of a given shape with bounded entries. An appropriate deformation of this algorithm gives an algorithm for the random generation of plane partitions inside a given box. | |
| dc.description | 23 pages, AmS-TeX | |
| dc.identifier | https://arxiv.org/abs/math/9807068 | |
| dc.identifier | http://arxiv.org/abs/math/9807068 | |
| dc.identifier | J. Combin. Theory Ser. A 88 (1999), 66-92 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77157 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 05A17 05A30 05E10 05E15 11P81 | |
| dc.title | Another involution principle-free bijective proof of Stanley's hook-content formula | |
| dc.type | text |