Search arXivSearch

arXiv · 1611.02545

Decompositions of Grothendieck Polynomials

Abstract

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-Richardson rule for expanding a product of Grothendieck polynomials in the glide basis. Our techniques easily extend to the $β$-Grothendieck polynomials of S. Fomin-A. Kirillov (1994), representing classes in connective $K$-theory, and we state our results in this more general context. A specialization of the glide basis recovers the fundamental slide polynomials of S. Assaf-D. Searles (2016), which play an analogous role with respect to the Chow ring of flag varieties. Additionally, the stable limits of another specialization of glide polynomials are T. Lam-P. Pylyavskyy's (2007) basis of multi-fundamental quasisymmetric functions, $K$-theoretic analogues of I. Gessel's (1984) fundamental quasisymmetric functions. Those glide polynomials that are themselves quasisymmetric are truncations of multi-fundamental quasisymmetric functions and form a basis of quasisymmetric polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Pechenik, Dominic Searles. 2016-11-08. Decompositions of Grothendieck Polynomials. https://doi.org/10.1093/imrn%2Frnx207

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO