Shifted insertion algorithms for primed words (2104.11437v4)

Abstract: This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known correspondences, namely, a shifted form of Edelman-Greene insertion, Sagan-Worley insertion, and Haiman's shifted mixed insertion. These maps have the property that when the input word varies such that one output tableau is fixed, the other output tableau ranges over all (semi)standard tableaux of a given shape with no primed diagonal entries. Our algorithms have the same feature, but now with primes allowed on the main diagonal. One application of this is to give another Littlewood-Richardson rule for products of Schur $Q$-functions. It is hoped that there will exist set-valued generalizations of our bijections that can be used to understand products of $K$-theoretic Schur $Q$-functions.