The Robinson–Schensted algorithm
Snapshots of modern mathematics from Oberwolfach
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.
If you are interested in translating this Snapshot, please contact us at firstname.lastname@example.org