A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A direct bijective proof of the hook-length formula
1997
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
International audience 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.
doi:10.46298/dmtcs.239
fatcat:winofwoy3nbrxhoemnhpxx4vtm