Color-to-spin ribbon Schensted algorithms Original Research Article

A new Schensted bijection is given from colored permutations to pairs of standard k-ribbon tableaux, such that twice the total color of the colored permutation, is equal to the sum of the spins of the pair of tableaux. A highly nontrivial extension of this bijection is also given, from colored words to a pair of k-ribbon tableaux, one semistandard and the other standard.