These pages illustrate the domino Robinson-Schensted algorithm.
This algorithm starts with a signed permutation and produces a pair of domino tableaux.
As with the ordinary Robinson-Schensted algorithm, the left tableau is the insertion, or bumping, tableau.
The right tableau is the recording tableau.
The first page shows either the final result of the algorithm or the result of each step of adding one number to the tableaux pair.
The second page has an animation of the bumping procedure.
The domino Robinson-Schensted algorithm is the first step in classifying Kazhdan-Lusztig cells (equivalently, classifying primitive ideals).
After that, we need to apply another procedure (called moving through cycles) to produce tableaux with a special shape.
To do that, we need first to place each tableau on a grid.
That's shown in the third page.
The fourth page shows the result of making the tableaux special.
The pages in the next section show more about the procedure of moving through cycles.