Tags: #definition

Robinson-Schensted-Knud correspondence

There exists a bijection between the following two sets:

• All permutations $w\in S_n$
• The set of pairs $(P,Q)$ of standard Young tableaus of the same shape $\lambda ⊢n$

Proof

This bijection follows by applying the Schensted insertion algorithm.