We give combinatorial proofs of two types of duality for Grothendieck polynomials by constructing a unified combinatorial framework incorporating set-valued tableaux, musltiset-valued tableaux, reverse plane partitions and valued-set tableaux. Importantly, our proofs extend to proofs of these dualities for the refined Grothendieck polynomials. The second of these dualities was formerly unknown for the refined case.
The notion of set-valued Young tableaux was introduced by Buch in his study of the Littlewood-Richardson rule for stable Grothendieck polynomials. Knutson, Miller and Yong showed that the double Grothendieck polynomials of 2143-avoiding permutations can be generated by set-valued Young tableaux. In this paper, we introduce the structure of set-valued Rothe tableaux of permutations. Given the Rothe diagram $D(w)$ of a permutation $w$, a set-valued Rothe tableau of shape $D(w)$ is a filling of finite nonempty subsets of positive integers into the squares of $D(w)$ such that the rows are weakly d…
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 formula and Stanley's formula. For skew shapes, our formulas generalize the Naruse hook-length formula and its $q$-analogues, which were studied in previous papers of the series.
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 Schützenberger gave a combinatorial formula for key polynomials using right keys; Buch gave a set-valued tableau formula for Grassmannian stable Grothendieck polynomials. We establish a novel combinatorial rule for Lascoux polynomials involving right keys and set-valued tableaux. Our rule recovers the tableaux formulas of key polynomials and Grassmannian stable Grothendieck…
In this article, we prove a tableau formula for the double Grothendieck polynomials associated to $321$-avoiding permutations. The proof is based on the compatibility of the formula with the $K$-theoretic divided difference operators.
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 and pairs of K-theoretic Q-Schur functions.
We introduce a family of tableaux that simultaneously generalizes the tableaux used to characterize Grothendieck polynomials and k-Schur functions. We prove that the polynomials drawn from these tableaux are the affine Grothendieck polynomials and k-K-Schur functions -- Schubert representatives for the K-theory of affine Grassmannians and their dual in the nil Hecke ring. We prove a number of combinatorial properties including Pieri rules.
Hook-valued tableau uncrowding and tableau switching
Sungkyunkwan University (SKKU)（成均馆大学）；North Carolina State University（北卡罗来纳州立大学）；Arizona State University（亚利桑那州立大学）；Colorado State University（科罗拉多州立大学）；UC Davis（加州大学戴维斯分校）
本文通过去拥挤和jeu de taquin算法，发现钩值表格与精美表格之间的联系，并基于表格切换的结果，提出双旗帜表格作为精细稳定Grothendieck多项式的新模型。
We show that the flagged Grothendieck polynomials defined as the generating functions of flagged set-valued tableaux of Knutson-Miller-Yong can be expressed by a Jacobi-Trudi type determinant formula generalizing the work of Hudson-Matsumura. We also introduce the flagged skew Grothendieck polynomials in these two expressions and show that they coincide.
We give a $U_q(\mathfrak{sl}_n)$-crystal structure on multiset-valued tableaux, hook-valued tableaux, and valued-set tableaux, whose generating functions are the weak symmetric, canonical, and dual weak symmetric Grothendieck functions, respectively. We show the result is isomorphic to a (generally infinite) direct sum of highest weight crystals, and for multiset-valued tableaux and valued-set tableaux, we provide an explicit bijection. As a consequence, these generating functions are Schur positive; in particular, the canonical Grothendieck functions, which was not previously known. We also g…
We show that the factorial flagged Grothendieck polynomials defined by flagged set-valued tableaux of Knutson-Miller-Yong can be expressed by a Jacobi-Trudi type determinant formula, generalizing the work of Hudson-Matsumura. In particular, we obtain an alternative proof of the tableau and determinant formulas of vexillary double Grothendieck polynomials, that have been obtained by Knutson-Miller-Yong and Hudson-Matsumura respectively. Moreover, we show that each factorial flagged Grothendieck polynomial can be obtained from a product of linear polynomials by applying K-theoretic divided diffe…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall-Littlewood polynomials and dual Grothendieck polynomials. The motivation behind this is that such recurrences are strongly connected with other nice properties, such as interpretations in terms of lattice points in polytopes and divided difference operators.
We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and dual Grothendieck polynomials.
In this paper we first present summation formulas for $k$-order Eulerian polynomials and $1/k$-Eulerian polynomials. We then present combinatorial expansions of $(c(x)D)^n$ in terms of inversion sequences as well as $k$-Young tableaux, where $c(x)$ is a differentiable function in the indeterminate $x$ and $D$ is the derivative with respect to $x$. We define the $g$-indexes of $k$-Young tableaux and Young tableaux, which have important applications in combinatorics. By establishing some relations between $k$-Young tableaux and standard Young tableaux, we express Eulerian polynomials, second-ord…
Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued tableaux formula for Macdonald polynomials. Our hope is that providing set-valued tableaux formulas for Macdonald polynomials will help to strengthen the analogies and possible connections between the calculus of Macdonald polynomials and Schubert calculus.
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it permits one to generate ribbon tableaux with skew shapes. This algorithm permits us to compute quickly big LLT polynomials in MuPAD-Combinat.
We prove that a family of average weights for oscillating tableaux are polynomials in two variables, namely, the length of the oscillating tableau and the size of the ending partition, which generalizes a result of Hopkins and Zhang. Several explicit and asymptotic formulas for the average weights are also derived.
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 some previous results: it generalizes a combinatorial formula obtained in earlier joint work with López Martín and Teixidor i Bigas concerning Brill-Noether curves, and it generalizes a 2000 formula of Lenart and a recent result of Reiner-Tenner-Yong to skew shapes. We also give an expansion in the other direction: expressing skew Schur functions in terms o…
Lock polynomials and lock Kohnert tableaux are natural analogues to key polynomials and key Kohnert tableaux, respectively. In this paper, we compare lock polynomials to the much-studied key polynomials and show that the difference of a key polynomial and lock polynomial for the same composition is monomial positive. We also examine the conditions for which key and lock polynomials are symmetric or quasisymmetric. We accomplish these goals combinatorially using key Kohnert tableaux and lock Kohnert tableaux. In particular, for the difference of a key minus a lock, we focus on the behavior of c…
The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This crystal yields a new combinatorial formula for decomposing symmetric Grothendieck polynomials into Schur polynomials. For single-columns and single-rows, we give a new combinatorial interpretation of Lascoux polynomials (K-analogs of Demazure characters) by constructing a K-theoretic analog of crystals with an appropriate analog of a Demazure crystal. We relate o…
Lascoux polynomials are $K$-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux ($\mathsf{RSVT}$) rule for Lascoux polynomials and reverse semistandard Young tableaux ($\mathsf{RSSYT}$) rule for key polynomials. Furthermore, key polynomials have a simple algorithmic model in terms of Kohnert diagrams, which are in bijection with $\mathsf{RSSYT}$. Ross and Yong introduced $K$-Kohnert diagrams, which are analogues of Kohnert diagrams. They conjectured a $K$-Kohnert diagram rule for Lascoux polynomials. We establish thi…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the characterization, we obtain descriptions of Schubert polynomials and Stanley symmetric functions.
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some transformation formulas for the basic hypergeometric series involving very well-poised balanced ${}_{12}W_{11}$ series. We remark that the correlation functions of the deformed $\mathcal{W}$ algebra generators automatically give rise to the tableau formulas when we principally specialize the coordinate variables.
We introduce the quasi-key basis of the polynomial ring. We prove this basis contains the quasi-Schur polynomials of of Haglund, Luoto, Mason and van Willigenburg and that stable limits of quasi-key polynomials are quasi-Schur functions, thus giving a lifting of the quasi-Schur basis of quasisymmetric polynomials to the full polynomial ring. We introduce the combinatorial model of Kohnert tableaux, and use this model to prove that key polynomials expand positively in quasi-key polynomials which in turn expand positively in the fundamental slide polynomials introduced earlier by the authors. We…
The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their monomials to the key polynomial indexed by pi and lambda. (These polynomials are the characters of the Demazure modules for GL(n).) The "atom" indexed by pi is the sum of weight monomials of the tableaux whose right keys are the "key" tableau for pi. Schur functions and key polynomials can be decomposed into sums of atoms. We also describe the tableaux that cont…
In this article we will introduce the way to extend the mitosis algorithm for Schubert polynomials, developed by Ezra Miller, to the case of Grothendieck polynomials.
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a generalisation of a Littlewood-Richardson rule for Grothendieck polynomials.
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 expanding stable Grothendieck polynomials.
Stable Grothendieck polynomials can be viewed as a K-theory analog of Schur polynomials. We extend stable Grothendieck polynomials to a two-parameter version, which we call canonical stable Grothendieck functions. These functions have the same structure constants (with scaling) as stable Grothendieck polynomials, and (composing with parameter switching) are self-dual under the standard involutive ring automorphism. We study various properties of these functions, including combinatorial formulas, Schur expansions, Jacobi-Trudi type identities, and associated Fomin-Greene operators.
We prove Jacobi-Trudi-type determinantal formulas for skew dual Grothendieck polynomials which are $K$-theoretic deformations of Schur polynomials. We also prove a bialternant-type formula analogous to the classical definition of Schur polynomials.
Symmetric Grothendieck polynomials are analogues of Schur polynomials in the K-theory of Grassmannians. We build dual families of symmetric Grothendieck polynomials using Schur operators. With this approach we prove skew Cauchy identity and then derive various applications: skew Pieri rules, dual filtrations of Young's lattice, generating series and enumerative identities. We also give a new explanation of the finite expansion property for products of Grothendieck polynomials.
The Schur polynomials $s_λ$ are essential in understanding the representation theory of the general linear group. They also describe the cohomology ring of the Grassmannians. For $ρ= (n, n-1, \dots, 1)$ a staircase shape and $μ\subseteq ρ$ a subpartition, the Stembridge equality states that $s_{ρ/μ} = s_{ρ/μ^T}$. This equality provides information about the symmetry of the cohomology ring. The stable Grothendieck polynomials $G_λ$, and the dual stable Grothendieck polynomials $g_λ$, developed by Buch, Lam, and Pylyavskyy, are variants of the Schur polynomials and describe the $K$-theory of the…
We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.
In 2007 Lam and Pylyavskyy found a combinatorial formula for the dual stable Grothendieck polynomials, which are the dual basis of the stable Grothendieck polynomials with respect to the Hall inner product. In 2016 Galashin, Grinberg, and Liu introduced refined dual stable Grothendieck polynomials by putting additional sequence of parameters in the combinatorial formula of Lam and Pylyavskyy. Grinberg conjectured a Jacobi--Trudi type formula for refined dual stable Grothendieck polynomials. In this paper this conjecture is proved by using bijections of Lam and Pylyavskyy.
The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and we prove that this generalization still defines symmetric functions. For this fact, we give two self-contained proofs, one of which constructs a family of involutions on the set of reverse plane partitions generalizing the Bender-Knuth involutions on semistandard tableaux, whereas the other classifies the structure of reverse plane partitions with entries 1…
Dumont and Foata introduced in 1976 a three-variable symmetric refinement of Genocchi numbers, which satisfies a simple recurrence relation. A six-variable generalization with many similar properties was later considered by Dumont. They generalize a lot of known integer sequences, and their ordinary generating function can be expanded as a Jacobi continued fraction. We give here a new combinatorial interpretation of the six-variable polynomials in terms of the alternative tableaux introduced by Viennot. A powerful tool to enumerate alternative tableaux is the so-called "matrix Ansatz", and usi…
Recently Galashin, Grinberg, and Liu introduced the refined dual stable Grothendieck polynomials, which are symmetric functions in $x=(x_1,x_2,\dots)$ with additional parameters $t=(t_1,t_2,\dots)$. The refined dual stable Grothendieck polynomials are defined as a generating function for reverse plane partitions of a given shape. They interpolate between Schur functions and dual stable Grothendieck polynomials introduced by Lam and Pylyavskyy in 2007. Flagged refined dual stable Grothendieck polynomials are a more refined version of refined dual stable Grothendieck polynomials, where lower and…
We use the Pieri and Giambelli formulas of arXiv:0809.4966 and arXiv:1109.6669 and the calculus of raising operators developed in arXiv:0811.2781 and arXiv:0812.0639 to prove a tableau formula for eta polynomials of arXiv:1109.6669 and the Stanley symmetric functions which correspond to Grassmannian elements of the Weyl group $W_n$ of type $D_n$. We define the skew elements of $W_n$ and exhibit a bijection between the set of reduced words for any skew element $w$ in $W_n$ and a set of certain standard typed tableaux on a skew shape $λ/μ$ associated to $w$.
We give a new operator formula for Grothendieck polynomials that generalizes Magyar's Demazure operator formula for Schubert polynomials. Our proofs are purely combinatorial, contrasting with the geometric and representation theoretic tools used by Magyar. We apply our formula to prove a necessary divisibility condition for a monomial to appear in a given Grothendieck polynomial.
It is a classical fundamental result that Schur-positive specializations of the ring of symmetric functions are characterized via totally positive functions whose parametrization describes the Edrei-Thoma theorem. In this paper we study positive specializations of symmetric Grothendieck polynomials, $K$-theoretic deformations of Schur polynomials.
We transform Tutte-Grothedieck invariants thus also Tutte polynomials on matroids so that the contraction-deletion rule for loops (isthmuses) coincides with the general case.
We give an explanation for the Pieri coefficients for the stable and dual stable Grothendieck polynomials; their non-leading terms are obtained by taking an alternating sum of meets (or joins) of their leading terms.
We study a family of dissections of flow polytopes arising from the subdivision algebra. To each dissection of a flow polytope, we associate a polynomial, called the left-degree polynomial, which we show is invariant of the dissection considered (proven independently by Grinberg). We prove that left-degree polynomials encode integer points of generalized permutahedra. Using that certain left-degree polynomials are related to Grothendieck polynomials, we resolve special cases of conjectures by Monical, Tokcan, and Yong regarding the saturated Newton polytope property of Grothendieck polynomials…
The problem of computing products of Schubert classes in the cohomology ring can be formulated as the problem of expanding skew Schur polynomials into the basis of ordinary Schur polynomials. In contrast, the problem of computing the structure constants of the Grothendieck ring of a Grassmannian variety with respect to its basis of Schubert structure sheaves is not equivalent to expanding skew stable Grothendieck polynomials into the basis of ordinary stable Grothendiecks. Instead, we show that the appropriate K-theoretic analogy is through the expansion of skew reverse plane partitions into t…
For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood-Richardson rule for the expansion of the corresponding dual stable Grothendieck polynomial in terms of Schur polynomials.
