Binomial determinants, paths, and hook length formulae

André, 1879, Developpements de sec x et de tang x, C. R. Acad. Sci. Paris, 965

Carlitz, 1973, Permutations with prescribed pattern, Math. Nachr., 58, 31, 10.1002/mana.19730580104

Chaundy, 1932, The unrestricted plane partition, Quart. J. Math. Oxford, 3, 76, 10.1093/qmath/os-3.1.76

Franzblau, 1982, A bijective proof of the hook-length formula, J. Algorithms, 3, 317, 10.1016/0196-6774(82)90029-3

Gansner, 1978, Matrix Correspondences and the Enumeration of Plane Partitions

Gansner, 1981, The Hillman-Grassl correspondence and the enumeration of reverse plane partitions, J. Combin. Theory Ser. A, 30, 71, 10.1016/0097-3165(81)90041-8

Garsia, 1981, A Rogers-Ramanujan bijection, J. Combin. Theory Ser. A, 31, 289, 10.1016/0097-3165(81)90062-5

I. Gessel and G. Viennot, Combinatorial interpretation of determinants with weighted paths, in preparation.

I. Gessel and G. Viennot, Determinants, paths, Young tableaux, and plane partitions, in preparation.

Goulden, 1983

Gupta, 1978, A new look at the permutations of the first n natural numbers, Indian J. Pure Appl. Math., 9, 600

Hillman, 1976, Reverse plane partitions and tableau hook numbers, J. Combin. Theory Ser. A, 21, 216, 10.1016/0097-3165(76)90065-0

Jacobi, 1834, 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, J. Reine Angew. Math., 12, 1, 10.1515/crll.1834.12.1

Karlin, 1959, Coincidence probabilities, Pacific J. Math., 9, 1141, 10.2140/pjm.1959.9.1141

Knuth, 1973

Lascoux, 1978, Classes de Chern d'un produit tensoriel, C. R. Acad. Sci. Paris, 286, 385

Ledermann, 1977

Lindström, 1973, On the vector representation of induced matroids, Bull. London Math. Soc., 5, 85, 10.1112/blms/5.1.85

Macdonald, 1979

MacMahon, 1908, Second memoir on the compositions of numbers, Philos. Trans. Roy. Soc. London Ser. A, 207, 65, 10.1098/rsta.1908.0002

Niven, 1968, A combinatorial problem of finite sequences, Nieuw Arch. Wisk., 16, 116

Remmel, 1982, Bijective proofs of formulae for the number of standard Young tableaux, Linear and Multilinear Algebra, 11, 45, 10.1080/03081088208817432

Remmel, 1983, A bijective proof of the hook formula for the number of column strict tableaux with bounded entries, European J. Combin., 4, 45, 10.1016/S0195-6698(83)80008-0

Remmel, 1984, A bijective proof of the generating function for the number of reverse plane partitions via lattice paths, Linear and Multilinear Algebra, 16, 75, 10.1080/03081088408817610

Stanley, 1971, Theory and applications of plane partitions, part 2, Stud. Appl. Math., 50, 259, 10.1002/sapm1971503259

Stanley, 1983, GL(n, C) for combinatorialists, 187

R. A. Sulanke, A determinant for q-counting n-dimensional lattice paths, preprint.

Viennot, 1980, Interpretations combinatoire de nombres d'Euler et de Genocchi