Related papers: Set-valued tableaux rule for Lascoux polynomials

Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Sch\"{u}tzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from…

We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…

We study the relation between quantum affine algebras of type A and Grassmannian cluster algebras. Hernandez and Leclerc described an isomorphism from the Grothendieck ring of a certain subcategory $\mathcal{C}_{\ell}$ of…

We show that combinatorial objects called row-strict composition tableaux, introduced by Mason and Remmel in 2014 and closely related to the quasi-symmetric Schur functions of Haglund-Luoto-Mason-van Willigenburg, form a basis for Schur…

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 show that functors like algebraic $K$-theory (such as unitary or symplectic $K$-functors), as well as the higher Grothendieck--Witt groups, possess the local constancy condition for Henselian valuation rings. Namely, taken with finite…

The Key map is an important tool in the determination of the Demazure crystals associated to Kac-Moody algebras. In finite type A, it can be computed in the tableau realization of crystals by a simple combinatorial procedure due to Lascoux…

We provide a fermionic description of flagged skew Grothendieck polynomials, which can be seen as a $K$-theoretic counterpart of flagged skew Schur polynomials. Our proof relies on the Jacobi-Trudi type formula established by Matsumura.…

We prove a formula for the structure sheaf of a quiver variety in the Grothendieck ring of its embedding variety. This formula generalizes and gives new expressions for Grothendieck polynomials. We furthermore conjecture that the…

We introduce coplactic raising and lowering operators $E'_i$, $F'_i$, $E_i$, and $F_i$ on shifted skew semistandard tableaux. We show that the primed operators and unprimed operators each independently form type A Kashiwara crystals (but…

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

We give an algebraic proof of the determinant formulas for factorial Grothendieck polynomials obtained by Hudson--Ikeda--Matsumura--Naruse and by Hudson--Matsumura.

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where…

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…

We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…

In 2005, A. Knutson--R. Vakil conjectured a puzzle rule for equivariant K-theory of Grassmannians. We resolve this conjecture. After giving a correction, we establish a modified rule by combinatorially connecting it to the authors' recently…