A Relation for Domino Robinson-Schensted Algorithms

2006/03/28 by Thomas Pietraho, Pietraho, Thomas
Mathematics · #05E10 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05E10

paper · pdf · doi:10.48550/arxiv.math/0603654

13 pages; Expanded introduction and minor corrections

arxiv created 2007/12/17 · arxiv updated 2009/12/01

Abstract

We describe a relationship between Robinson-Schensted algorithms defined for standard domino tableaux of unequal rank. The principal idea is the moving-through operation defined on standard domino tableaux by D. Garfinkle. When restricted to involutions, this answers a question posed by M.A.A. van Leeuwen.

Related

• Sign under the domino Robinson-Schensted maps
• Some bijective correspondences involving domino tableaux
• Plactic relations for r-domino tableaux
• Domino tableaux, Schutzenberger involution, and the symmetric group action
• Robinson-Schensted Algorithms Obtained from Tableau Recursions