Robinson Schensted Algorithm
Versandkostenfrei!
Versandfertig in 6-10 Tagen
26,99 €
inkl. MwSt.
PAYBACK Punkte
13 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, the Robinson Schensted algorithm is a combinatorial algorithm, first described by (Robinson 1938), which establishes a bijective correspondence between elements of the symmetric group Sn and pairs of standard Young tableaux of the same shape.Schensted (1961) independently discovered the algorithm and generalized it to the case where P is semi-standard and b is any sequence of n numbers. The Robinson Schensted Knuth algorithm was developed by Knuth (197...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, the Robinson Schensted algorithm is a combinatorial algorithm, first described by (Robinson 1938), which establishes a bijective correspondence between elements of the symmetric group Sn and pairs of standard Young tableaux of the same shape.Schensted (1961) independently discovered the algorithm and generalized it to the case where P is semi-standard and b is any sequence of n numbers. The Robinson Schensted Knuth algorithm was developed by Knuth (1970) and establishes a bijective correspondence between generalized permutations (two-line arrays of lexicographically ordered positive integers) and pairs of semi-standard Young tableaux of the same shape. Zelevinsky (1981) gave a further generalization to pictures.
