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. © Birkhäuser Verlag Basel/Switzerland 2009.
