A direct bijective proof of the hook-length formula
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 o...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Discrete Mathematics & Theoretical Computer Science
1997-01-01
|
| سلاسل: | Discrete Mathematics & Theoretical Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://dmtcs.episciences.org/239/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|