The major counting of nonintersecting lattice paths and generating functions for tableaux

A theory of counting nonintersecting lattice paths by the major index and generalizations of it is developed. We obtain determinantal expressions for the corresponding generating functions for families of nonintersecting lattice paths with given starting points and given final points, where the starting points lie on a line parallel to x+y = 0. In some cases these determinants can be evaluated to result into simple products. As applications we compute the generating function for tableaux with p odd rows, with at most c columns, and with parts between 1 and n. Besides, we compute the generating function for the same kind of tableaux which in addition have only odd parts. We thus also obtain a closed form for the generating function for symmetric plane partitions with at most n rows, with parts between 1 and c, and with p odd entries on the main diagonal. In each case the result is a simple product. By summing with respect to p we provide new proofs of the Bender–Knuth and MacMahon (ex-)Conjectures, which were first proved by Andrews, Gordon, and Macdonald. The link between nonintersecting lattice paths and tableaux is given by variations of the Knuth correspondence. Summary of results and sketch of proofs We announce the proof of the following refinements of the MacMahon (ex-)Conjecture and the Bender–Knuth (ex-)Conjecture. (All the definitions can be found in the Appendix.) Theorem 1 (Refinement of the MacMahon (ex-)Conjecture) The generating function for tableaux with p odd rows (i.e. exactly p rows have odd length), with at

[1]  Carol Bult,et al.  PERMUTATIONS , 1994 .

[2]  R. Stanley Theory and applications of plane partitions: Part 1 , 1971 .

[3]  Basil Gordon,et al.  A proof of the Bender-Knuth conjecture. , 1983 .

[4]  Gérard Viennot,et al.  Enumeration of certain young tableaux with bounded height , 1986 .

[5]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[6]  George E. Andrews,et al.  The equivalence of the Bender-Knuth and MacMahon conjectures , 1977 .

[7]  J. Desarmenien Une généralisation des formules de Gordon et de MacMahon , 1989 .

[8]  J. Shaw Combinatory Analysis , 1917, Nature.

[9]  J. Désarménien A proof of the identities of Gordon and MacMahon and two new identities. (La démonstration des identités de Gordon et MacMahon et de deux identités nouvelles.) , 1986 .

[10]  M. Wodzicki Lecture Notes in Math , 1984 .

[11]  G. Viennot,et al.  Une forme geometrique de la correspondance de Robinson-Schensted , 1977 .

[12]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[13]  S. Milne,et al.  TheCℓ Bailey transform and Bailey lemma , 1993 .

[14]  I. Gessel,et al.  Binomial Determinants, Paths, and Hook Length Formulae , 1985 .

[15]  Robert A. Proctor New Symmetric Plane Partition Identities from Invariant Theory Work of De Concini and Procesi , 1990, Eur. J. Comb..

[16]  Edward A. Bender,et al.  Enumeration of Plane Partitions , 1972, J. Comb. Theory A.

[17]  Donald E. Knuth,et al.  PERMUTATIONS, MATRICES, AND GENERALIZED YOUNG TABLEAUX , 1970 .

[18]  T. Koornwinder,et al.  BASIC HYPERGEOMETRIC SERIES (Encyclopedia of Mathematics and its Applications) , 1991 .

[19]  John R. Stembridge,et al.  Hall-Littlewood functions, plane partitions, and the Rogers-Ramanujan identities , 1990 .

[20]  William H. Burge,et al.  Four Correspondences Between Graphs and Generalized Young Tableaux , 1974, J. Comb. Theory A.

[21]  Mizan Rahman,et al.  Basic Hypergeometric Series , 1990 .

[22]  Robert A. Proctor Bruhat Lattices, Plane Partition Generating Functions, and Minuscule Representations , 1984, Eur. J. Comb..