Super RSK-algorithms and super plactic monoid

Details Super RSK-algorithms and super plactic monoid Super RSK-algorithms and super plactic monoid

2009-04-03

arxiv.org/abs/0904.0605v1

International Journal of Algebra and Computation vol. 16, no. 2, pp. 377-396 (2006)

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Super RSK-algorithms and super plactic monoid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Super RSK-algorithms and super plactic monoid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Super RSK-algorithms and super plactic monoid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151156