1998/07/13 by Christian Krattenthaler
Mathematics · #math.CO #msc:05A15 #msc:05A17 #msc:05A30 #msc:05E10 #msc:05E15 #msc:11P81
published as J. Combin. Theory Ser. A 88 (1999), 66-92 · 23 pages, AmS-TeX
arxiv created 1998/07/13 · arxiv updated 2009/11/30
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.