Related papers: A bijection between $K$-Kohnert diagrams and rever…

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

Lascoux polynomials generalize Grassmannian stable Grothendieck polynomials and may be viewed as K-theoretic analogs of key polynomials. The latter two polynomials have combinatorial formulas involving tableaux: Lascoux and…

We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

This report formulates a conjectural combinatorial rule that positively expands Grothendieck polynomials into Lascoux polynomials. It generalizes one such formula expanding Schubert polynomials into key polynomials, and refines another one…

The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known…

We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…

We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…

We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…

We introduce shifted analogues of key polynomials related to symplectic and orthogonal orbit closures in the complete flag variety. Our definitions are given by applying isobaric divided difference operators to the analogues of Schubert…

The Bernshtein-Kushnirenko-Khovanskii theorem provides a generic root count for system of Laurent polynomials in terms of the mixed volume of their Newton polytopes (i.e., the BKK bound). A recent and far-reaching generalization of this…

We prove K-theoretic and shifted K-theoretic analogues of the bijection of Stanton and White between domino tableaux and pairs of semistandard tableaux. As a result, we obtain product formulas for pairs of stable Grothendieck polynomials…

We introduce two new bases of the ring of polynomials and study their relations to known bases. The first basis is the quasiLascoux basis, which is simultaneously both a $K$-theoretic deformation of the quasikey basis and also a lift of the…

We give a minimal counterexample for a conjecture of Ross and Yong (2015) which proposes a K-Kohnert rule for Grothendieck polynomials. We conjecture a revised version of this rule. We then prove both rules hold in the $321$-avoiding case.

This paper gives a tableau formula for expanding the product of a Lascoux polynomial and a stable Grothendieck polynomial into Lascoux polynomials. Lascoux and stable Grothendieck polynomials are inhomogeneous analogues of key polynomials…

The Bitableax correspondence isomorphism/Koszul map Theorem (BCK Theorem, for short, Theorem 6.5 below) describes a relevant pair of mutually inverse vector space isomorphisms, the Koszul map K : U(gl(n))-> Sym(gl(n)) and the bitableaux…

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…

A poset on a certain class of partitions known as k-shapes was recently introduced to provide a combinatorial rule for the expansion of a (k-1)-Schur functions into k-Schur functions at t=1. The main ingredient in this construction was a…