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.

About this item

Creator
Thomas Pietraho
Date
2010-01-01
Bowdoin Department or Program
Mathematics
Subject
Domino tableaux
Robinson-Schensted algorithm
Access
Open access

Supplemental Files

Current image, full-size
Current image, reduced-size
Other download options:

Collection organization

Level of Description Summary Catalog Record