10.46298/dmtcs.239
https://dmtcs.episciences.org/239
Novelli, Jean-Christophe
Jean-Christophe
Novelli
Pak, Igor
Igor
Pak
Stoyanovskii, Alexander V.
Alexander V.
Stoyanovskii
A direct bijective proof of the hook-length formula
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.
episciences.org
Hook-length formula
bijective proof
inverse algorithms
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
1997-01-01
1997-01-01
en
journal article
https://hal.science/hal-00955690v1
1365-8050
https://dmtcs.episciences.org/239/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 1
Researchers
Students