Shuffle invariance of the super-RSK algorithm

Abstract: As in the

(k, l)

-RSK (Robinson-Schensted-Knuth) of [1], other super-RSK algorithms can be applied to sequences of variables from the set

t_{1}, ..., t_{k}, u_{1}, ..., u_{l}

, where

t_{1} < ... < t_{k}

, and

u_{1} < ... < u_{l}

. While the

(k, l)

-RSK of [1] is the case where

t_{i} < u_{j}

for all

i

and

j

, these other super-RSK's correspond to all the

shuffles of the

t

's and

u

's satisfying the above restrictions that

t_{1} < ... < t_{k}

and

u_{1} < ... < u_{l}

. We show that the shape of the tableaux produced by any such super-RSK is independent of the particular shuffle of the

t

's and

u

's.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: Shuffle invariance of the super-RSK algorithm