Related papers: Mixed jeu de taquin and a problem of Soojin Cho
The plactic monoid $\mathbf{P}$ of Lascoux and Sch\"{u}tzenberger (1981) plays an important role in proofs of the Littlewood-Richardson rule for computing multiplicities in the linear representation theory of the symmetric group…
We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his…
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Sch\"{u}tzenberger's jeu de taquin on the…
We introduce a shifted analog of the plactic monoid of Lascoux and Sch\"utzenberger, the \emph{shifted plactic monoid}. It can be defined in two different ways: via the \emph{shifted Knuth relations}, or using Haiman's mixed insertion.…
Sch\"utzenberger's jeu de taquin is an algorithm on the structure of tableaux, which transforms a skew tableau into a Young one by local transformation rules on the columns of the tableaux. This algorithm defines an equivalence relation on…
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…
For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with…
Patrias and Pylyavskyy introduced shifted Hecke insertion as an application of their theory of dual filtered graphs. We use shifted Hecke insertion to construct symmetric function representatives for the K-theory of the orthogonal…
We introduce new combinatorial objects called the shifted domino tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the…
We give a backward jeu de taquin slide analogue on semistandard reverse composition tableaux. These tableaux were first studied by Haglund, Luoto, Mason and van Willigenburg when defining quasisymmetric Schur functions. Our algorithm for…
We introduce edge labeled Young tableaux. Our main results provide a corresponding analogue of [Sch\"{u}tzenberger '77]'s theory of jeu de taquin. These are applied to the equivariant Schubert calculus of Grassmannians. Reinterpreting, we…
We introduce a theory of jeu de taquin for increasing tableaux, extending fundamental work of [Sch\"{u}tzenberger '77] for standard Young tableaux. We apply this to give a new combinatorial rule for the K-theory Schubert calculus of…
We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
We present a proof of a Littlewood-Richardson rule for the K-theory of odd orthogonal Grassmannians OG(n,2n+1), as conjectured in [Thomas-Yong '09]. Specifically, we prove that rectification using the jeu de taquin for increasing shifted…
We investigate Robinson-Schensted-Knuth algorithm (RSK) and Sch\"utzenberger's jeu de taquin in the infinite setup. We show that the recording tableau in RSK defines an isomorphism of the following two dynamical systems: (i) a sequence of…
The direct sum map Gr(a,n) x Gr(b,m) -> Gr(a+b,m+n) on Grassmannians induces a K-theory pullback that defines the splitting coefficients. We geometrically explain an identity from [Buch '02] between the splitting coefficients and the…
Fomin (1994) introduced a notion of duality between two graded graphs on the same set of vertices. He also introduced a generalization to dual graded graphs of the classical Robinson-Schensted-Knuth algorithm. We show how Fomin's approach…
We define crystal operators on semistandard shifted tableaux, giving a new proof that Schur $P$-functions are Schur positive. We define a queer crystal operator to construct a connected queer crystal on semistandard shifted tableaux of a…
We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…