Super RSK-algorithms and super plactic monoid

Simple item page
dc.creatorLa Scala, R.
dc.creatorNardozza, V.
dc.creatorSenato, D.
dc.date2009-04-03
dc.date.accessioned2026-07-07T13:00:21Z
dc.date.available2026-07-07T13:00:21Z
dc.descriptionWe construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are proved without restrictions on the orderings of the alphabets.
dc.identifierhttps://arxiv.org/abs/0904.0605
dc.identifierhttp://arxiv.org/abs/0904.0605
dc.identifierInternational Journal of Algebra and Computation vol. 16, no. 2, pp. 377-396 (2006)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225817
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subject05E10, 05E15, 20Cxx
dc.titleSuper RSK-algorithms and super plactic monoid
dc.typetext

Files

Collections

arXiv