Binomial determinants, paths, and hook length formulae

Advances in Mathematics

Volumn 58, Issue 3, 1985, Pages 300-321

  Gessel, Ira ^a   Viennot, Gérard ^b  

^a BRANDEIS UNIVERSITY   (United States)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000868570     PISSN: 00018708     EISSN: 10902082     Source Type: Journal    
DOI: 10.1016/0001-8708(85)90121-5     Document Type: Article

References (28)

1. Developpements de sec x et de tang x
2. Permutations with prescribed pattern
3. The unrestricted plane partition
4. A bijective proof of the hook-length formula
5. Matrix Correspondences and the Enumeration of Plane Partitions
6. The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
7. A Rogers-Ramanujan bijection
8. A new look at the permutations of the first n natural numbers
9. Reverse plane partitions and tableau hook numbers
10. De binis quibuslibet functionibus homogeneis secundi ordinis per substitutiones lineares in alias binas transformandis quae solis quadratis variabilium constant; una cum variis theorematis de transformatione et determinatione integralium multiplicium
11. Coincidence probabilities
12. Classes de Chern d'un produit tensoriel
13. On the vector representation of induced matroids
14. Second memoir on the compositions of numbers
15. A combinatorial problem of finite sequences
16. Bijective proofs of formulae for the number of standard Young tableaux
17. A bijective proof of the hook formula for the number of column strict tableaux with bounded entries
18. A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
19. Theory and applications of plane partitions, part 2
20. GL(n, C) for combinatorialists
21. Interpretations combinatoire de nombres d'Euler et de Genocchi