Discrete Mathematics & Theoretical Computer Science, Vol 1 (1997)

Font Size:  Small  Medium  Large

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.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page