The weighted hook length formula

Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wilf, as well as the q-walk of Kerov. Further applications are also presented.Comment: 14 pages, 4 figure

The weighted hook-length formula II: Complementary formulas

Recently, a new weighted generalization of the branching rule for the hook lengths, equivalent to the hook formula, was proved. In this paper, we generalize the complementary branching rule, which can be used to prove Burnside's formula. We present three different proofs: bijective, via weighted hook walks, and via the ordinary weighted branching rule.Comment: 20 pages, 9 figure

Enumeration of Standard Young Tableaux

A survey paper, to appear as a chapter in a forthcoming Handbook on Enumeration.Comment: 65 pages, small correction