nLab Robinson-Schensted-Knuth correspondence

Redirected from "Robinson-Schensted-Knuth algorithm".

Idea

Robinson–Schensted correspondence is a canonical bijection between the permutations from the symmetric group Σ(n)\Sigma(n) on nn letters and pairs of standard Young tableaux of the same type.

Robinson-Schensted-Knuth correspondence is a combinatorial bijection sending matrices with non-negative integer entries to pairs of semistandard Young tableaux.

Variants

References

Wikipedia: Robinson–Schensted correspondence, Robinson–Schensted–Knuth_correspondence

A textbook account is in

For an overview see

  • Per Alexandersson, The Robinson–Schensted–Knuth correspondence, webpage

  • Christian Krattenthaler, Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes. Advances in Applied Mathematics, 37(3):404–431, September 2006 (arXiv:math/0510676).

  • Pierre-Loïc Méliot, Kerov’s central limit theorem for Schur–Weyl measures of parameter 1/2 (arXiv:1009.4034)

  • Donald E. Knuth, Permutations, matrices, and generalized Young tableaux. Pacific Journal of Mathematics 34 (3): 709–727 (1970) doi

  • Masatoshi Noumi, Yasuhiko Yamada, Tropical Robinson–Schensted–Knuth correspondence and birational Weyl group actions, in: Representation Theory of Algebraic Groups and Quantum Groups, in: Adv. Stud. Pure Math. 40, Math. Soc. Japan, Tokyo, 2004, pp. 371–442

RSK correspondence satisfies the octahedron recurrence. In the following article this is established with a point of view that RSK correspondence is a tropicalization? of Dodgson condensation rule,

On a bijective proof of that fact

  • Miriam Farber, Sam Hopkins, Wuttisak Trongsiriwat, Interlacing networks: Birational RSK, the octahedron recurrence, and Schur function identities, Journal of Combinatorial Theory A 133 (2015) 339–371 doi
category: combinatorics

Last revised on August 2, 2024 at 19:34:45. See the history of this page for a list of all contributions to it.