The Schensted correspondence is a bijection between permutations of 
elements and pairs of standard Young
tableaux of the same shape, each containing 1, 2, ..., 
once. The Robinson-Schensted-Knuth
correspondence extends this construction to matrices of nonnegative integers.
Schensted Correspondence
See also
Permutation, Robinson-Schensted-Knuth Correspondence, Young TableauExplore with Wolfram|Alpha
References
Knuth, D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, 1973.Stanton, D. W. and White, D. E. §3.6 in Constructive Combinatorics. New York: Springer-Verlag, pp. 85-87, 1986.Referenced on Wolfram|Alpha
Schensted CorrespondenceCite this as:
Weisstein, Eric W. "Schensted Correspondence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SchenstedCorrespondence.html