A Relation for Domino Robinson-Schensted Algorithms

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages; Expanded introduction and minor corrections

Keywords

Combinatorics, 05E10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144279

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0603654
 http://arxiv.org/abs/math/0603654

Collections

arXiv