Page d'accueil du CNRS Page d'accueil de l'Université Paris Diderot Page d'accueil du LIAFA
LIAFA
Laboratoire d'Informatique Algorithmique: Fondements et Applications
CNRS UMR 7089, Université Paris Diderot - Paris 7, Case 7014
75205 Paris Cedex 13 - Tél: +33(0)1.57.27.92.56 - Fax: +33(0)1.57.27.94.09
   Staff      Contact      How to get to LIAFA      Teaching      Webmail   


Version fran├žaise




Page d'accueil de la Fédération de Recherche en Mathématiques de Paris Centre

Page d'accueil de la Fondation Sciences Mathématiques de Paris
Research reports

  • Year of publication: 1997
  • Authors: J-C novelli, I. Pak, A. stoyanovkii
  • Title: A direct bijective proof of the Hook-length formula
  • Summary:


     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 presents the proof of the bijectivity of the construction. We finish with some examples.



  • Complete report:
    PostScript file compressed with gzip
    PostScript format
    pdf format

 
 ©  LIAFA 1995, Last updating: 2014, July webmestre[at]liafa.univ-paris-diderot.fr