mathematics

Robinson–Schensted–Knuth correspondence

Robinson–Schensted–Knuth correspondence is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Robinson–Schensted–Knuth correspondence rather than just read about it. In short: In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices A with non-negative integer entries and pairs (P,Q) of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of A. More precisely the weight of P is given by the column sums of A, and the weight of Q by its row sums.

Key takeaways

Robinson–Schensted–Knuth correspondence belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Robinson–Schensted–Knuth correspondence to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Robinson–Schensted–Knuth correspondence from memory before moving on to harder problems.

Reference excerpt

In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices A with non-negative integer entries and pairs (P,Q) of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of A. More precisely the weight of P is given by the column sums of A, and the weight of Q by its row sums. It is a generalization of the Robinson–Schensted correspondence, in the sense that taking A to be a permutation matrix, the pair (P,Q) will be the pair of standard tableaux associated to the permutation under the Robinson–Schensted correspondence. The Robinson–Schensted–Knuth correspondence extends many of the remarkable properties of the Robinson–Schensted correspondence, notably its symmetry: transposition of the matrix A results in interchange of the tableaux P,Q.

The Robinson–Schensted–Knuth correspondence

Introduction The Robinson–Schensted correspondence is a bijective mapping between permutations and pairs of standard Young tableaux, both having the same shape. This bijection can be constructed using an algorithm called Schensted insertion, starting with an empty tableau and successively inserting the values σ1, ..., σn of the permutation σ at the numbers 1, 2, ..., n; these form the second line when σ is given in two-line notation:

σ = ( 1 2 … n σ 1 σ 2 … σ n ) {\displaystyle \sigma ={\begin{pmatrix}1&2&\ldots &n\\\sigma _{1}&\sigma _{2}&\ldots &\sigma _{n}\end{pmatrix}}} . The first standard tableau P is the result of successive insertions; the other standard tableau Q records the successive shapes of the intermediate tableaux during the construction of P. The Schensted insertion easily generalizes to the case where σ has repeated entries; in that case the correspondence will produce a semistandard tableau P rather than a standard tableau, but Q will still be a standard tableau. The definition of the RSK correspondence reestablishes symmetry between the P and Q tableaux by producing a semistandard tableau for Q as well.

Two-line arrays The two-line array (or generalized permutation) wA corresponding to a matrix A is defined as

w A = ( i 1 i 2 … i m j 1 j 2 … j m ) {\displaystyle w_{A}={\begin{pmatrix}i_{1}&i_{2}&\ldots &i_{m}\\j_{1}&j_{2}&\ldots &j_{m}\end{pmatrix}}}

in which for any pair (i,j) that indexes an entry Ai,j of A, there are Ai,j columns equal to ( i j ) {\displaystyle {\tbinom {i}{j}}} , and all columns are in lexicographic order, which means that

i 1 ≤ i 2 ≤ i 3 ⋯ ≤ i m {\displaystyle i_{1}\leq i_{2}\leq i_{3}\cdots \leq i_{m}} , and if i r = i s {\displaystyle i_{r}=i_{s}\,} and r ≤ s {\displaystyle r\leq s} then j r ≤ j s {\displaystyle j_{r}\leq j_{s}} .

Example The two-line array corresponding to

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Robinson–Schensted–Knuth correspondence

Start with the simplest possible case. Write down what Robinson–Schensted–Knuth correspondence claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Robinson–Schensted–Knuth correspondence before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Robinson–Schensted–Knuth correspondence ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Robinson–Schensted–Knuth correspondence

In research: Robinson–Schensted–Knuth correspondence appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Robinson–Schensted–Knuth correspondence in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Robinson–Schensted–Knuth correspondence is common in secondary-school and first-year university syllabi. It links to neighbouring topics Algebraic combinatorics, Combinatorial algorithms, Donald Knuth, so understanding it makes those chapters shorter.
In everyday life: Look for Robinson–Schensted–Knuth correspondence outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Robinson–Schensted–Knuth correspondence” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Robinson–Schensted–Knuth correspondence in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Robinson–Schensted–Knuth correspondence means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Robinson–Schensted–Knuth correspondence out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Robinson–Schensted–Knuth correspondence in simple terms?

Why does Robinson–Schensted–Knuth correspondence matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Robinson–Schensted–Knuth correspondence?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Robinson–Schensted–Knuth correspondence.