Jean-Christophe Novelli ; Igor Pak ; Alexander V. Stoyanovskii - A direct bijective proof of the hook-length formula

dmtcs:239 - Discrete Mathematics & Theoretical Computer Science, January 1, 1997, Vol. 1 -
A direct bijective proof of the hook-length formula

Authors: Jean-Christophe Novelli 1; Igor Pak 2; Alexander V. Stoyanovskii 3

  • 1 Laboratoire d'informatique Algorithmique : Fondements et Applications
  • 2 Department of Mathematics [Cambridge]
  • 3 Department of Mathematics [Moscou]

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.

Volume: Vol. 1
Published on: January 1, 1997
Imported on: March 26, 2015
Keywords: Hook-length formula,bijective proof,inverse algorithms,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/0001-8708(79)90023-9
  • 10.1016/0001-8708(79)90023-9
A probabilistic proof of a formula for the number of Young tableaux of a given shape

12 Documents citing this article

Consultation statistics

This page has been seen 1173 times.
This article's PDF has been downloaded 983 times.