SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID

From MaRDI portal
Publication:5483468

DOI10.1142/S0218196706003025zbMATH Open1096.05052arXiv0904.0605OpenAlexW2017793330MaRDI QIDQ5483468FDOQ5483468


Authors: Roberto La Scala, Vincenzo Nardozza, D. Senato Edit this on Wikidata


Publication date: 14 August 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: We 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.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID

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