Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4655751 | Journal of Combinatorial Theory, Series A | 2011 | 15 Pages |
Abstract
Based on the ideas in Ciocan-Fontanine, Konvalinka and Pak (2009) [5], , 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 Greene, Nijenhuis and Wilf (1979) [15], , as well as the q-walk of Kerov (1993) [20]. Further applications are also presented.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics