本文定义弱对称 $P$-Grothendieck 多项式以推广 $P$-Schur 多项式，并引入移位多重集表给出其组合实现，从而类比集值表推广半标准 Young 表的方式。
摘要：
对称 Grothendieck 多项式推广了 Schur 多项式，并且按次数是 Schur 正的。在组合上，这表现为用集值表（set-valued tableaux）推广半标准 Young 表。我们定义了一个（弱）对称 $P$-Grothendieck 多项式，它以同样的方式推广了 $P$-Schur 多项式。在组合上，这表现为用一种我们称之为移位多重集表（shifted multiset tableaux）的新型表来推广移位半标准 Young 表。
英文摘要：
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) symmetric $P$-Grothendieck polynomial which generalizes $P$-Schur polynomials in the same way. Combinatorially this is manifested as the generalization of shifted semistandard Young tableaux by a new type of tableaux which we call shifted multiset tableaux.
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…
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.
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.
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.
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.
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the $h^\ast$-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomials. In both cases, we prove tha…
Gustafson and Milne proved an identity on the Schur function indexed by a partition of the form $(λ_1-n+k,λ_2-n+k,\ldots,λ_k-n+k)$. On the other hand, Fehér, Némethi and Rimányi found an identity on the Schur function indexed by a partition of the form $(m-k,\ldots,m-k, λ_1,\ldots,λ_k)$. Fehér, Némethi and Rimányi gave a geometric explanation of their identity, and they raised the question of finding a combinatorial proof. In this paper, we establish a Gustafson-Milne type identity as well as a Fehér-Némethi-Rimányi type identity for factorial Grothendieck polynomials. Specializing a factorial…
The question of when two skew Young diagrams produce the same skew Schur function has been well-studied. We investigate the same question in the case of stable Grothendieck polynomials, which are the K-theoretic analogues of the Schur functions. We prove a necessary condition for two skew shapes to give rise to the same dual stable Grothendieck polynomial. We also provide a necessary and sufficient condition in the case where the two skew shapes are ribbons.
We construct a vertex model whose partition function is a refined dual Grothendieck polynomial, where the states are interpreted as nonintersecting lattice paths. Using this, we show refined dual Grothendieck polynomials are multi-Schur functions and give a number of identities, including a Littlewood and Cauchy(-Littlewood) identity. We then refine Yeliussizov's connection between dual Grothendieck polynomials and the last passage percolation (LPP) stochastic process discussed by Johansson. By refining algebraic techniques of Johansson, we show Jacobi-Trudi formulas for skew refined dual Grot…
Skew stable Grothendieck polynomials are $K$-theoretic analogues of skew Schur polynomials. We give a free-fermionic presentation of skew stable Grothendieck polynomials and their dual symmetric functions. By using our presentation, we derive a family of determinantal formulas, which are $K$-analogues of the Jacobi-Trudi formula for skew Schur functions. We also introduce a combinatorial method to calculate certain expansions of skew (dual) stable Grothendieck polynomials by using the non-commutative supersymmetric Schur functions.
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…
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.
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.
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.
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…
The ring of symmetric functions has a basis of dual Grothendieck polynomials that are inhomogeneous $K$-theoretic deformations of Schur polynomials. We prove that dual Grothendieck polynomials determine column distributions for a directed last-passage percolation model.
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We show Newton polytopes of these Grothendieck polynomials and their homogeneous components have SNP. Moreover, the Newton polytope of each homogeneous component is a permutahedron. This addresses recent conjectures of C. Monical-N. Tokcan-A. Yong and of A. Fink-K. Mészáros-A. St. Dizier in this special case.
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.
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.
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.
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.
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 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.
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…
Recent work of Pechenik, Speyer, and Weigandt proved a formula for the degree of any Grothendieck polynomial. A distinct formula for the degree of vexillary Grothendieck polynomials was proven by Rajchgot, Robichaux, and Weigandt. We give a new proof of Pechenik, Speyer, and Weigandt's formula in the special case of vexillary permutations and characterize the set of bumpless pipe dreams which contribute maximal degree terms to the Grothendieck polynomial in this case. Furthermore, we use this characterization to draw connections between the Pechenik-Speyer-Weigandt and Rajchgot-Robichaux-Weiga…
This paper is based on a series of talks given at the Patejdlovka Enumeration Workshop held in the Czech Republic in November 2007. The topics covered are as follows. The graph polynomial, Tutte-Grothendieck invariants, an overview of relevant elementary finite Fourier analysis, the Tutte polynomial of a graph as a Hamming weight enumerator of its set of tensions (or flows), and a description of a family of polynomials containing the graph polynomial which yield Tutte-Grothendieck invariants in a similar way.
A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck polynomials introduced by Lenart, Robinson, and Sottile (2006). Moreover, for any term order satisfying $x_1<x_2<\cdots<x_n$ we present the leading monomial of each homogeneous components of the Grothendieck polynomial $\mathfrak{G}_w(x_1,\ldots,x_n)$, confirming a conjecture of Hafner (2022). We conclude with a conjecture for the leading monomials of the homogenegous…
We show that sequences of skew Schur polynomials obtained from stretched semi-standard Young tableaux satisfy a linear recurrence, which we give explicitly. Using this, we apply this to finding certain asymptotic behavior of these Schur polynomials and present conjectures on minimal recurrences for stretched Schur polynomials.
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…
Buch and Rimányi proved a formula for specializations of double Grothendieck polynomials based on the Yang-Baxter equation related to the degenerate Hecke algebra. A geometric proof was found by Yong and Woo by constructing a Gröbner basis for the Kazhdan-Lusztig ideals. In this note, we give an elementary proof for this formula by using only divided difference operators.
LLT polynomials are $q$-analogues of product of Schur functions that are known to be Schur-positive by Grojnowski and Haiman. However, there is no known combinatorial formula for the coefficients in the Schur expansion. Finding such a formula also provides Schur positivity of Macdonald polynomials. On the other hand, Haiman and Hugland conjectured that LLT polynomials for skew partitions lying on $k$ adjacent diagonals are $k$-Schur positive, which is much stronger than Schur positivity. In this paper, we prove the conjecture for $k=2$ by analyzing unicellular LLT polynomials. We first present…
We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and H.Naruse in Adv. Math.(2013) for the case of maximal Grassmannian permutations. We also give geometric interpretation of them in terms of algebraic localization map and give explicit combinatorial formulas.
Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized Schur operators to generalize the Robinson-Schensted-Knuth correspondence. In this sense, generalized Schur operators are generalizations of semi-standard Young tableaux. We define a generalization of Schur polynomials as expansion coefficients of generalized Schur operators. We show that the commutating relation of generalized Schur operators implies Pieri's f…
Schubert polynomials $\mathfrak{S}_w$ are polynomial representatives for cohomology classes of Schubert varieties in a complete flag variety, while Grothendieck polynomials $\mathfrak{G}_w$ are analogous representatives for the $K$-theory classes of the structure sheaves of Schubert varieties. In the special case that $\mathfrak{S}_w$ is a multiplicity-free sum of monomials, K. Mészáros, L. Setiabrata, and A. St. Dizier conjectured that $\mathfrak{G}_w$ can be easily computed from $\mathfrak{S}_w$ via Möbius inversion on a certain poset. We prove this conjecture.
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 investigate the longstanding problem of finding a combinatorial rule for the Schubert structure constants in the $K$-theory of flag varieties (in type $A$). The Grothendieck polynomials of A. Lascoux-M.-P. Schützenberger (1982) serve as polynomial representatives for $K$-theoretic Schubert classes; however no positive rule for their multiplication is known outside the Grassmannian case. We contribute a new basis for polynomials, give a positive combinatorial formula for the expansion of Grothendieck polynomials in these glide polynomials, and provide a positive combinatorial Littlewood-Rich…
We give a combinatorial interpretation of a Pieri formula for double Grothendieck polynomials in terms of an interval of the Bruhat order. Another description had been given by Lenart and Postnikov in terms of chain enumerations. We use Lascoux's interpretation of a product of Grothendieck polynomials as a product of two kinds of generators of the 0-Hecke algebra, or sorting operators. In this way we obtain a direct proof of the result of Lenart and Postnikov and then prove that the set of permutations occuring in the result is actually an interval of the Bruhat order.
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
