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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Discrete Mathematics & Theoretical Computer Science
1997-01-01
|
| Serier: | Discrete Mathematics & Theoretical Computer Science |
| Fag: | |
| Online adgang: | https://dmtcs.episciences.org/239/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|