Search arXivSearch

arXiv · math/0405539

Grothendieck polynomials via permutation patterns and chains in the Bruhat order

Abstract

We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of variables, with coefficients Schubert structure constants for Grothendieck polynomials. The other type is in terms of chains in the Bruhat order. We compare this second type to other constructions of Grothendieck polynomials within the more general context of double Grothendieck polynomials and the closely related H-polynomials. Our methods are based upon the geometry of permutation patterns.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian Lenart, Shawn Robinson, Frank Sottile. 2005-11-15. Grothendieck polynomials via permutation patterns and chains in the Bruhat order. https://arxiv.org/abs/math/0405539

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