Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Robinson–Schensted_correspondence> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Robinson–Schensted_correspondence abstract "In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has various descriptions, all of which are of algorithmic nature, it has many remarkable properties, and it has applications in combinatorics and other areas such as representation theory. The correspondence has been generalized in numerous ways, notably by Knuth to what is known as the Robinson–Schensted–Knuth correspondence, and a further generalization to pictures by Zelevinsky.The simplest description of the correspondence is using the Schensted algorithm (Schensted 1961), a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction. The correspondence had been described, in a rather different form, much earlier by Robinson (Robinson 1938), in an attempt to prove the Littlewood–Richardson rule. The correspondence is often referred to as the Robinson–Schensted algorithm, although the procedure used by Robinson is radically different from the Schensted–algorithm, and almost entirely forgotten. Other methods of defining the correspondence include a nondeterministic algorithm in terms of jeu de taquin.The bijective nature of the correspondence relates it to the enumerative identity:where denotes the set of partitions of n (or of Young diagrams with n squares), and tλ denotes the number of standard Young tableaux of shape λ.".
- Robinson–Schensted_correspondence thumbnail Young-Schensted.png?width=300.
- Robinson–Schensted_correspondence wikiPageID "1901026".
- Robinson–Schensted_correspondence wikiPageRevisionID "604145619".
- Robinson–Schensted_correspondence author "Craige Schensted".
- Robinson–Schensted_correspondence authorlink "Gilbert de Beauregard Robinson".
- Robinson–Schensted_correspondence first "M.A.A.".
- Robinson–Schensted_correspondence id "R/r110120".
- Robinson–Schensted_correspondence last "Robinson".
- Robinson–Schensted_correspondence last "Schensted".
- Robinson–Schensted_correspondence last "van Leeuwen".
- Robinson–Schensted_correspondence title "Robinson–Schensted correspondence".
- Robinson–Schensted_correspondence year "1938".
- Robinson–Schensted_correspondence year "1961".
- Robinson–Schensted_correspondence subject Category:Algebraic_combinatorics.
- Robinson–Schensted_correspondence subject Category:Combinatorial_algorithms.
- Robinson–Schensted_correspondence subject Category:Permutations.
- Robinson–Schensted_correspondence subject Category:Representation_theory_of_finite_groups.
- Robinson–Schensted_correspondence comment "In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has various descriptions, all of which are of algorithmic nature, it has many remarkable properties, and it has applications in combinatorics and other areas such as representation theory.".
- Robinson–Schensted_correspondence label "Correspondance de Robinson-Schensted".
- Robinson–Schensted_correspondence label "Robinson–Schensted correspondence".
- Robinson–Schensted_correspondence label "Алгоритм Робинсона — Шенстеда".
- Robinson–Schensted_correspondence sameAs Robinson%E2%80%93Schensted_correspondence.
- Robinson–Schensted_correspondence sameAs Correspondance_de_Robinson-Schensted.
- Robinson–Schensted_correspondence sameAs Q2997917.
- Robinson–Schensted_correspondence sameAs Q2997917.
- Robinson–Schensted_correspondence wasDerivedFrom Robinson–Schensted_correspondence?oldid=604145619.
- Robinson–Schensted_correspondence depiction Young-Schensted.png.
