The weighted hook length formula

From MaRDI portal
Publication:543902

DOI10.1016/J.JCTA.2011.02.004zbMATH Open1227.05034arXiv1006.0043OpenAlexW2031546273MaRDI QIDQ543902FDOQ543902


Authors: Ionuţ Ciocan-Fontanine, Matjaž Konvalinka, Igor Pak Edit this on Wikidata


Publication date: 17 June 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1006.0043




Recommendations




Cites Work


Cited In (18)

Uses Software





This page was built for publication: The weighted hook length formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543902)