Journal of Algebraic Combinatorics

, Volume 4, Issue 1, pp 5–45 | Cite as

Schensted Algorithms for Dual Graded Graphs

  • Sergey Fomin


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.

discrete algorithm enumerative combinatorics poset Young diagram 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S.V. Fomin, “Two-dimensional growth in Dedekind lattices,” M. S. thesis, Leningrad State University, 1979.Google Scholar
  2. 2.
    S.V. Fomin, “Generalized Robinson-Schensted-Knuth correspondence,” Zapiski Nauchn. Sem. LOMI 155 (1986), 156–175 [in Russian].Google Scholar
  3. 3.
    S. Fomin, Duality of graded graphs, Report No. 15 (1991/92), Institut Mittag-Leffler, 1992; J. Algebr. Combinatorics 3 (1994), 357–404.Google Scholar
  4. 4.
    S. Fomin, Schensted algorithms for dual graded graphs, Report No. 16 (1991/92), Institut Mittag-Leffler, 1992.Google Scholar
  5. 5.
    S. Fomin, Dual graphs and Schensted correspondences, Séries formelles et combinatoire algébrique, P. Leroux and C. Reutenauer, Ed., Montréal, LACIM, UQAM, 1992, 221–236.Google Scholar
  6. 6.
    D.V. Fomin and S.V. Fomin, Problem 1240, Kvant, 1991, No. 1, 22–25 [in Russian].Google Scholar
  7. 7.
    S. Fomin and D. Stanton, Rim hook lattices, Report No. 23 (1991/92), Institut Mittag-Leffler, 1992.Google Scholar
  8. 8.
    C.Greene, “An extension of Schensted's theorem,” Adv. in Math. 14 (1974), 254–265.Google Scholar
  9. 9.
    C. Greene and D.J. Kleitman, “The structure of Sperner k-families,” J. Combin. Theory, Ser. A 20 (1976), 41–68.Google Scholar
  10. 10.
    C. Greene, “Some partitions associated with a partially ordered set,” J. Combin. Theory, Ser. A 20 (1976), 69–79.Google Scholar
  11. 11.
    M.D. Haiman, “On mixed insertion, symmetry, and shifted Young tableaux,” J.Combin. Theory, Ser. A 50 (1989), 196–225.Google Scholar
  12. 12.
    D.E. Knuth, “Permutations, matrices, and generalized Young tableaux,” Pacific J. Math. 34 (1970), 709–727.Google Scholar
  13. 13.
    I.G. Macdonald, Symmetric functions and Hall polynomials, Oxford Univ. Press, Oxford, 1979.Google Scholar
  14. 14.
    J. Riordan, An introduction to combinatorial analysis, Wiley, New York, 1966.Google Scholar
  15. 15.
    T.W. Roby, “Applications and extensions of Fomin's generalization of the Robinson-Schensted correspondence to differential posets,” Ph.D. thesis, M.I.T., 1991.Google Scholar
  16. 16.
    B.E. Sagan, “Shifted tableaux, Schur Q-functions and a conjecture of R. Stanley,” J. Comb. Theory, Ser. A 45 (1987), 62–103.Google Scholar
  17. 17.
    B.E. Sagan, “The ubiquitous Young tableaux,” Invariant Theory and Tableaux, D. Stanton, Ed., Springer-Verlag, 1990, 262–298.Google Scholar
  18. 18.
    B.E. Sagan and R.P. Stanley, “Robinson-Schensted algorithms for skew tableaux,” J.Combin. Theory, Ser. A 55 (1990), 161–193.Google Scholar
  19. 19.
    C. Schensted, “Longest increasing and decreasing subsequences,” Canad. J. Math. 13 (1961), 179–191.Google Scholar
  20. 20.
    M.-P. Schützenberger, “La correspondence de Robinson,” Combinatoire et représentation du groupe symétrique, D. Foata ed., Lecture Notes in Math. 579 (1977), 59–135.Google Scholar
  21. 21.
    R.P. Stanley, “Theory and application of plane partitions,” Parts 1 and 2, Studies in Applied Math. 50 (1971), 167–188, 259–279.Google Scholar
  22. 22.
    R.P. Stanley, “Differential posets,” J. Amer. Math. Soc. 1 (1988), 919–961.Google Scholar
  23. 23.
    D. Stanton and D. White, “A Schensted algorithm for rim hook tableaux,” J. Comb. Theory, Ser. A 40 (1985), 211–247.Google Scholar
  24. 24.
    D. Stanton and D. White, Constructive combinatorics, Springer-Verlag, 1986.Google Scholar
  25. 25.
    S. Sundaram, “On the combinatorics of representations of Sp (2n, ℂ)),” Ph.D. thesis, M.I.T., 1986.Google Scholar
  26. 26.
    M.A.A. van Leeuwen, “A Robinson-Schensted algorithm in the geometry of flags for classical groups,” Thesis, Rijksuniversiteit Utrecht, 1989.Google Scholar
  27. 27.
    M.A.A. van Leeuwen, New proofs concerning the Robinson-Schensted and Schützenberger algorithms, Preprint Nr. 700, Utrecht University, Dept. Mathematics, 1991.Google Scholar
  28. 28.
    X.G. Viennot, “Maximal chains of subwords and up-down sequences of permutations,” J. Comb. Theory, Ser. A 34 (1983), 1–14.Google Scholar
  29. 29.
    D.R. Worley, “A theory of shifted Young tableaux,” Ph.D. thesis, M.I.T., 1984.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Sergey Fomin
    • 1
    • 2
  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridge
  2. 2.Theory of Algorithms Laboratory, SPIIRANRussian Academy of SciencesRussia

Personalised recommendations