Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Weighted branching f ...
Conference paper

Weighted branching formulas for the hook lengths

Ionuţ Ciocan-Fontanine (1) (1), Matjaž Konvalinka ORCID (2), Igor Pak (3)
(1) School of Mathematics
(2) Department of Mathematics, Vanderbilt University
(3) Department of Mathematics [UCLA]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Proceedings
DOI
10.46298/dmtcs.2850
License
https://about.hal.science/hal-authorisation-v1
Indicators
563
Views
539
Downloads

Weighted branching formulas for the hook lengths

Ionuţ Ciocan-Fontanine (1) (1), Matjaž Konvalinka ORCID (2), Igor Pak (3)
(1) School of Mathematics
(2) Department of Mathematics, Vanderbilt University
(3) Department of Mathematics [UCLA]
Abstract
English
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.
French
La formule bien connue de la longueur des crochets est une conséquence simple de la règle de branchement des longueurs des crochets. La preuve la plus répandue de cette règle est de nature probabiliste et est due à Greene-Njenhuis-Wilf. Elle n'est toutefois pas complètement combinatoire et une simple bijection a été pendant longtemps un problème ouvert. Dans ce résumé étendu, nous proposons un argument bijectif élégant qui démontre une version à poids plus forte de cette règle. Des variantes de cette bijection permettent d'obtenir sept autres formules intéressantes. Une autre approche importante de ces formules est via les marches des crochets à poids. Nous discutons certains résultats dans cette direction. Enfin, nous présentons aussi une autre motivation à l'origine de ce travail: les $J$-fonctions du schéma d'Hilbert des points.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Hilbert scheme of points
  • hook-length formula
  • bijective proofs
Preview
Loading PDF preview...