Search arXivSearch

arXiv · math/0609110

Affine insertion and Pieri rules for the affine Grassmannian

Abstract

We study combinatorial aspects of the Schubert calculus of the affine Grassmannian Gr associated with SL(n,C). Our main results are: 1) Pieri rules for the Schubert bases of H^*(Gr) and H_*(Gr), which expresses the product of a special Schubert class and an arbitrary Schubert class in terms of Schubert classes. 2) A new combinatorial definition for k-Schur functions, which represent the Schubert basis of H_*(Gr). 3) A combinatorial interpretation of the pairing between homology and cohomology of the affine Grassmannian. These results are obtained by interpreting the Schubert bases of Gr combinatorially as generating functions of objects we call strong and weak tableaux, which are respectively defined using the strong and weak orders on the affine symmetric group. We define a bijection called affine insertion, generalizing the Robinson-Schensted Knuth correspondence, which sends certain biwords to pairs of tableaux of the same shape, one strong and one weak. Affine insertion offers a duality between the weak and strong orders which does not seem to have been noticed previously. Our cohomology Pieri rule conjecturally extends to the affine flag manifold, and we give a series of related combinatorial conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Lam, Luc Lapointe, Jennifer Morse, Mark Shimozono. 2008-11-23. Affine insertion and Pieri rules for the affine Grassmannian. https://arxiv.org/abs/math/0609110

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