Skip to Main content Skip to Navigation
Journal articles

A direct bijective proof of the hook-length formula

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00955690
Contributor : Alain Monteil <>
Submitted on : Wednesday, March 5, 2014 - 9:30:58 AM
Last modification on : Saturday, March 28, 2020 - 2:16:33 AM
Long-term archiving on: : Thursday, June 5, 2014 - 10:52:15 AM

File

dm010104.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00955690, version 1

Collections

Citation

Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii. A direct bijective proof of the hook-length formula. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, 1, pp.53-67. ⟨hal-00955690⟩

Share

Metrics

Record views

363

Files downloads

1819