Shuffle invariance of the super-RSK algorithm (Q696799)

The paper is concerned with a further generalisation of A. Berele and A. Regev's generalisation of the Robinson-Schensted-Knuth (RSK) correspondence: While Berele and Regev's \((k,l)\)-RSK maps permutations of the alphabet \(t_1<\dots <t_k<u_1<\dots<u_l\) to pairs of tableaux by applying the usual RSK insertion to the letters \(t_i\) and the conjugate correspondence to the letters \(u_j\), here all \({k+l}\choose{l}\) shuffles of the letters (i.e., reorderings, where only the conditions \(t_1<\dots <t_k\) and \(u_1<\dots<u_l\) apply) are considered. It is shown that the shape of the resulting tableaux is independent of the particular shuffle.