A direct bijective proof of the hook-length formula - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 1997

A direct bijective proof of the hook-length formula

Résumé

This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.
Fichier principal
Vignette du fichier
dm010104.pdf (175.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00955690 , version 1 (05-03-2014)

Identifiants

Citer

Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii. A direct bijective proof of the hook-length formula. Discrete Mathematics and Theoretical Computer Science, 1997, Vol. 1, pp.53-67. ⟨10.46298/dmtcs.239⟩. ⟨hal-00955690⟩
199 Consultations
1328 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More