论文信息 - Generalized Robinson-Schensted-Knuth correspondence

Generalized Robinson-Schensted-Knuth correspondence

The Robinson-Schensted-Knuth correspondence RSK associates with any permutation a pair of paths in a Young graph. The duality theorem for finite partially ordered sets associates with each such set a Young diagram. An independent account is given of the theory of these correspondences, in which the first of them arises on the basis of the second as a concrete version of the construction of “two-dimensional growth,” generalizing RSK to a large class of graded graphs.

S. Fomin | S. V. Fomin

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

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

[3] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

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

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

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

[7] G. de B. Robinson,et al. On the Representations of the Symmetric Group , 1938 .

[8] A. Vershik,et al. Locally semisimple algebras. Combinatorial theory and the K0-functor , 1987 .

[9] Marcel P. Schützenberger. Quelques remarques sur une Construction de Schensted. , 1963 .

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

[11] A. Vershik,et al. The characters of the infinite symmetric group and probability properties of the Robinson-Schensted-Knuth algorithm , 1986 .