Super RSK correspondence with symmetry (Q2415091): Difference between revisions

The Robinson-Schensted-Knuth (RSK) correspondence is a famous correspondence between biwords (two-line arrays of letters) and pairs of semistandard Young tableux. The paper considers the generalization of RSK correspondence to combinatorial objects associated with the representation theory and invariant theory of superalgebras. The author proves that an adaptation of the mixed insertion algorithm defined by \textit{M. D. Haiman} [J. Comb. Theory, Ser. A 50, No. 2, 196--225 (1989; Zbl 0697.05005)] can be used to define a super-RSK correspondence between restricted superbiwords and same-shape pairs of semistandard supertableaux.