Sign under the Domino Robinson-schensted Maps
- THOMAS PIETRAHO
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 M.A. A. van Leeuwen. The principal technique is derived from operations defined on standard domino tableaux by D.Garfinkle which must be extended to this more general setting.