e/Robinson–Schensted algorithm

Information
has gloss	eng: In mathematics, the Robinson–Schensted algorithm is a combinatorial algorithm, first described by , which establishes a bijective correspondence between elements of the symmetric group S_n and pairs of standard Young tableaux of the same shape. It can be viewed as a simple, constructive proof of the combinatorial identity: :\sum_\lambda\vdash n} (f^\lambda)^2= n! where \lambda\vdash n means \lambda varies over all partitions of n and f^\lambda is the number of standard Young tableaux of shape \lambda. It does this by constructing a map from pairs of \lambda-tableaux (P,Q) to permutations b.
lexicalization	eng: Robinson-Schensted algorithm
lexicalization	eng: Robinson–Schensted algorithm
instance of	(noun) act of changing the lineal order of objects in a group permutation