Schensted Algorithms for Dual Graded Graphs

Abstract This paper is a sequel to [3]. We keep the notation and terminology and extend the numbering of sections, propositions, and formulae of [3].The main result of this paper is a generalization of the Robinson-Schensted correspondence to the class of dual graded graphs introduced in [3], This class extends the class of Y-graphs, or differential posets [22], for which a generalized Schensted correspondence was constructed earlier in [2].The main construction leads to unified bijective proofs of various identities related to path counting, including those obtained in [3]. It is also applied to permutation enumeration, including rook placements on Ferrers boards and enumeration of involutions.As particular cases of the general construction, we re-derive the classical algorithm of Robinson, Schensted, and Knuth [19, 12], the Sagan-Stanley [18], Sagan-Worley [16, 29] and Haiman's [11] algorithms and the author's algorithm for the Young-Fibonacci graph [2]. Some new applications are suggested.The rim hook correspondence of Stanton and White [23] and Viennot's bijection [28] are also special cases of the general construction of this paper.In [5], the results of this paper and the previous paper [3] were presented in a form of extended abstract.

[1]  D. White,et al.  Constructive combinatorics , 1986 .

[2]  Curtis Greene.  Some Partitions Associated with a Partially Ordered Set , 1976, J. Comb. Theory, Ser. A.

[3]  Sergey Fomin,et al.  Duality of Graded Graphs , 1994 .

[4]  Dennis E. White,et al.  A Schensted Algorithm for Rim Hook Tableaux , 1985, J. Comb. Theory, Ser. A.

[5]  Curtis Greene,et al.  An Extension of Schensted's Theorem , 1974 .

[6]  Daniel J. Kleitman,et al.  The Structure of Sperner k-Families , 1976, J. Comb. Theory, Ser. A.

[7]  Marcel Paul Schützenberger,et al.  La correspondance de Robinson , 1977 .

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

[9]  Bruce E. Sagan.  Shifted tableaux, schur Q-functions, and a conjecture of R. Stanley , 1987, J. Comb. Theory, Ser. A.

[10]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1958 .

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

[12]  Dale Raymond Worley,et al.  A theory of shifted Young tableaux , 1984 .

[13]  Mark D. Haiman.  On mixed insertion, symmetry, and shifted young tableaux , 1989, J. Comb. Theory, Ser. A.

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

[15]  S. Fomin,et al.  Generalized Robinson-Schensted-Knuth correspondence , 1988 .

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

[17]  Bruce E. Sagan,et al.  The Ubiquitous Young Tableau , 1988 .

[18]  Gérard Viennot,et al.  Maximal Chains of Subwords and Up-Down Sequences of Permutations , 1983, J. Comb. Theory, Ser. A.

[19]  John Riordan,et al.  Introduction to Combinatorial Analysis , 1959 .

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

[21]  C. Schensted.  Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.

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