Weighted branching formulas for the hook lengths
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010).

Voir la notice de l'article provenant de la source Episciences

The famous hook-length formula is a simple consequence of the branching rule for the hook lengths. While the Greene-Nijenhuis-Wilf probabilistic proof is the most famous proof of the rule, it is not completely combinatorial, and a simple bijection was an open problem for a long time. In this extended abstract, we show an elegant bijective argument that proves a stronger, weighted analogue of the branching rule. Variants of the bijection prove seven other interesting formulas. Another important approach to the formulas is via weighted hook walks; we discuss some results in this area. We present another motivation for our work: $J$-functions of the Hilbert scheme of points.
@article{DMTCS_2010_special_259_a45,
     author = {Ciocan-Fontanine, Ionu\c{t} and Konvalinka, Matja\v{z} and Pak, Igor},
     title = {Weighted branching formulas for the hook lengths},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)},
     year = {2010},
     doi = {10.46298/dmtcs.2850},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2850/}
}
TY  - JOUR
AU  - Ciocan-Fontanine, Ionuţ
AU  - Konvalinka, Matjaž
AU  - Pak, Igor
TI  - Weighted branching formulas for the hook lengths
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2850/
DO  - 10.46298/dmtcs.2850
LA  - en
ID  - DMTCS_2010_special_259_a45
ER  - 
%0 Journal Article
%A Ciocan-Fontanine, Ionuţ
%A Konvalinka, Matjaž
%A Pak, Igor
%T Weighted branching formulas for the hook lengths
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2850/
%R 10.46298/dmtcs.2850
%G en
%F DMTCS_2010_special_259_a45
Ciocan-Fontanine, Ionuţ; Konvalinka, Matjaž; Pak, Igor. Weighted branching formulas for the hook lengths. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) (2010). doi : 10.46298/dmtcs.2850. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2850/

Cité par Sources :