Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01167508n
Noun Named Entity
Categories: Permutations, Representation theory of finite groups, Algebraic combinatorics, Combinatorial algorithms
EN
Robinson–Schensted correspondence  Robinson-Schensted algorithm  Robinson-Schensted correspondence  Robinson correspondence  Robinson–Schensted algorithm
EN
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. Wikipedia
IS A
Robinson–Schensted–Knuth correspondence
picture
Wikipedia
EN
Robinson–Schensted correspondence
Wikidata
EN
Robinson–Schensted correspondence
Wikipedia Redirections
EN
Robinson-Schensted algorithm, Robinson-Schensted correspondence, Robinson correspondence, Robinson–Schensted algorithm, Schensted algorithm, Schensted correspondence, Schensted insertion

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License