A Relation for Domino Robinson-Schensted Algorithms
Combinatorics
2007-12-17 v3
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.
Cite
@article{arxiv.math/0603654,
title = {A Relation for Domino Robinson-Schensted Algorithms},
author = {Thomas Pietraho},
journal= {arXiv preprint arXiv:math/0603654},
year = {2007}
}
Comments
13 pages; Expanded introduction and minor corrections