5 research outputs found
Shuffle Invariance of the Super-RSK Algorithm
As in the -RSK (Robinson-Schensted-Knuth) of [1], other super-RSK
algorithms can be applied to sequences of variables from the set
, where , and . While
the -RSK of [1] is the case where for all and , these
other super-RSK's correspond to all the (\big{(}{{k+l}\atop{k}}\big{)}
shuffles of the 's and 's satisfying the above restrictions that
and . We show that the shape of the tableaux
produced by any such super-RSK is independent of the particular shuffle of the
's and 's.Comment: 22 page