A color-to-spin domino Schensted algorithm (Q5934079)
From MaRDI portal
scientific article; zbMATH DE number 1605742
Language | Label | Description | Also known as |
---|---|---|---|
English | A color-to-spin domino Schensted algorithm |
scientific article; zbMATH DE number 1605742 |
Statements
A color-to-spin domino Schensted algorithm (English)
0 references
18 June 2001
0 references
Summary: We describe the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen. We place this algorithm in the context of Haiman's mixed and left-right insertion algorithms and extend it to colored words. It follows easily from this description that total color of a colored word maps to the sum of the spins of a pair of \(2\)-ribbon tableaux. Various other properties of this algorithm are described, including an alternative version of the Littlewood-Richardson bijection which yields the \(q\)-Littlewood-Richardson coefficients of Carré and Leclerc. The case where the ribbon tableau decomposes into a pair of rectangles is worked out in detail. This case is central in recent work by D. White on the number of even and odd linear extensions of a product of two chains.
0 references
domino Schensted algorithm
0 references
insertion algorithms
0 references
spins
0 references
2-ribbon tableaux
0 references
Littlewood-Richardson bijection
0 references
\(q\)-Littlewood-Richardson coefficients
0 references