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...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Discrete Mathematics & Theoretical Computer Science
1997-01-01
|
| Ráidu: | Discrete Mathematics & Theoretical Computer Science |
| Fáttát: | |
| Liŋkkat: | https://dmtcs.episciences.org/239/pdf |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|