Discrete Mathematics & Theoretical Computer Science
Volume 1 n° 1 (1997), pp. 53-67
| author: | Jean-Christophe Novelli and Igor Pak and Alexander V. Stoyanovskii |
|---|---|
| title: | A direct bijective proof of the hook-length formula |
| keywords: | Hook-length formula, bijective proof, inverse algorithms |
| abstract: | 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. |
| reference: | Jean-Christophe Novelli and Igor Pak and Alexander V. Stoyanovskii (1997), A direct bijective proof of the hook-length formula, Discrete Mathematics and Theoretical Computer Science 1, pp. 53-67 |
| ps.gz-source: | dm010104.ps.gz |
| ps-source: | dm010104.ps ( 154 K ) |
| pdf-source: | dm010104.pdf ( 195 K ) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Automatically produced on Tue Jan 19 17:48:59 MET 1999 by gustedt