The Robinson–Schensted algorithm

Thumbnail
View/Open
Date
2022-05-06
Series
Snapshots of modern mathematics from Oberwolfach;2022-02
Author
Thomas, Hugh
Metadata
Show full item record
SNAP-2022-002-EN
Abstract
I am going to describe the Robinson–Schensted algorithm which transforms a permutation of the numbers from 1 to n into a pair of combinatorial objects called “standard Young tableaux”. I will then say a little bit about a few of the fascinating properties of this transformation, and how it connects to current research.
DOI
10.14760/SNAP-2022-002-EN
Mathematical Subject
Algebra and Number Theory
Discrete Mathematics and Foundations
Collections

Preview
Preview IconOpen Preview


The following license files are associated with this item:

Attribution-ShareAlike 4.0 International
Except where otherwise noted, this item's license is described as Attribution-ShareAlike 4.0 International