Prefer a chat interface with context about you and your work?
SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID
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 …