bn:01533224n
Noun Concept
EN
Robinson–Schensted–Knuth correspondence  Robinson-Schensted-Knuth algorithm  Robinson-Schensted-Knuth correspondence  Robinson-Shensted-Knuth correspondence  Robinson–Schensted–Knuth algorithm
EN
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices A with non-negative integer entries and pairs of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of A. More precisely the weight of P is given by the column sums of A, and the weight of Q by its row sums. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices A with non-negative integer entries and pairs of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of A. More precisely the weight of P is given by the column sums of A, and the weight of Q by its row sums. Wikipedia
between biwords and pairs of tableaux Wikidata