论文信息 - Counting paths in Young's lattice

Counting paths in Young's lattice

Abstract Young's lattice is the lattice of partitions of integers, ordered by inclusion of diagrams. Standard Young tableaux can be represented as paths in Young's lattice that go up by one square at each step, and more general paths in Young's lattice correspond to more general kinds of tableaux. Using the theory of symmetric functions, in particular Pieri's rule for multiplying a Schur function by a complete symmetric function, we derive formulas for counting paths in Young's lattice that go up or down by horizontal or vertical strips. Our results are related to Richard Stanley's theory of differential posets in the special case of Young's lattice.

Ira M. Gessel | I. Gessel

[1] Dennis Stanton,et al. Invariant theory and tableaux , 1990 .

[2] Sheila Sundaram,et al. The Cauchy identity for Sp(2n) , 1990, J. Comb. Theory, Ser. A.

[3] Jeffrey B. Remmel. The combinatorics of (k,`)-Hook Schur functions , 1983 .

[4] Serge Dulucq,et al. An analogue to Robinson-Schensted correspondence for oscillating tableaux. , 1988 .

[5] Ira M. Gessel,et al. Symmetric functions and P-recursiveness , 1990, J. Comb. Theory, Ser. A.

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

[7] Sheila Sundaram. On the combinatorics of representations of Sp(2n,C) , 1986 .

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

[9] Tom Roby,et al. Applications and extensions of Fomin's generalization of the Robinson-Schensted correspondence to differential posets , 1991 .

[10] Bruce E. Sagan,et al. Robinson-schensted algorithms for skew tableaux , 1990, J. Comb. Theory A.

[11] Alain Lascoux,et al. S-function series , 1988 .