A relation for domino Robinson-Schensted algorithms

From MaRDI portal
Publication:659807

DOI10.1007/S00026-009-0034-9zbMATH Open1229.05283arXivmath/0603654OpenAlexW2593296737MaRDI QIDQ659807FDOQ659807

Thomas Pietraho

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0603654





Cites Work


Cited In (10)






This page was built for publication: A relation for domino Robinson-Schensted algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659807)