A Relation for Domino Robinson-Schensted Algorithms

Simple item page
dc.creatorPietraho, Thomas
dc.date2006-03-28
dc.date2007-12-17
dc.date.accessioned2026-07-07T08:49:23Z
dc.date.available2026-07-07T08:49:23Z
dc.descriptionWe 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.
dc.description13 pages; Expanded introduction and minor corrections
dc.identifierhttps://arxiv.org/abs/math/0603654
dc.identifierhttp://arxiv.org/abs/math/0603654
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144279
dc.subjectCombinatorics
dc.subject05E10
dc.titleA Relation for Domino Robinson-Schensted Algorithms
dc.typetext

Files

Collections

arXiv