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