Skip to main

Mathematics (thesaurus)

Search from vocabulary

Concept information

mathematical analysis > combinatorics > permutation > Robinson-Schensted-Knuth correspondence
algebra > combinatorics > permutation > Robinson-Schensted-Knuth correspondence
mathematical analysis > function > symmetric function > Robinson-Schensted-Knuth correspondence
mathematical analysis > combinatorics > algebraic combinatorics > Robinson-Schensted-Knuth correspondence
algebra > combinatorics > algebraic combinatorics > Robinson-Schensted-Knuth correspondence

Término preferido

Robinson-Schensted-Knuth correspondence  

Definición

  • 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 (P,Q) 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. It is a generalization of the Robinson–Schensted correspondence, in the sense that taking A to be a permutation matrix, the pair (P,Q) will be the pair of standard tableaux associated to the permutation under the Robinson–Schensted correspondence.
    The Robinson–Schensted–Knuth correspondence extends many of the remarkable properties of the Robinson–Schensted correspondence, notably its symmetry: transposition of the matrix A results in interchange of the tableaux P,Q.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Robinson%E2%80%93Schensted%E2%80%93Knuth_correspondence)

Etiquetas alternativas

  • RSK algorithm
  • RSK correspondence

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/PSR-MQ44ZV7K-7

Descargue este concepto:

RDF/XML TURTLE JSON-LD Creado 18/8/23, última modificación 18/10/24