We construct the analog 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.
Super RSK-algorithms and super plactic monoid
LA SCALA, Roberto;NARDOZZA, VINCENZO;
2006-01-01
Abstract
We construct the analog 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
