A Relation for Domino Robinson-Schensted Algorithms

摘要

We describe a map relating hyperoctahedral Robinson-Schensted algorithms on standard domino tableaux of unequal rank. Iteration of this map relates the algorithms defined by Garfinkle and Stanton-White and when restricted to involutions, this construction answers a question posed by van Leeuwen. The principal technique is derived from operations defined on standard domino tableaux by Garfinkle which must be extended to this more general setting. AMS Subject Classification 05E10 Keywords domino tableaux - Robinson-Schensted algorithm