Changing Bases with Pipe Dream Combinatorics
Anna Weigandt

TL;DR
This paper develops combinatorial rules using bumpless pipe dreams to express Grothendieck polynomials in terms of Schubert polynomials, providing new proofs and formulas for basis changes in algebraic combinatorics.
Contribution
It introduces explicit combinatorial rules for basis change between Grothendieck and Schubert polynomials using bumpless pipe dreams and provides new proofs via co-transition recurrences.
Findings
Bumpless pipe dreams enable basis change formulas.
New combinatorial proofs for existing rules.
Explicit expansion formulas in Bruhat order.
Abstract
Lascoux and Sch\"utzenberger introduced Schubert and Grothendieck polynomials to study the cohomology and K-theory of the complete flag variety. We present explicit combinatorial rules for expressing Grothendieck polynomials in the basis of Schubert polynomials, and vice versa, using the bumpless pipe dreams (BPDs) of Lam, Lee, and Shimozono. A key advantage of BPDs is that they are naturally back stable, which allows us to give a combinatorial formula for expanding back stable Grothendieck polynomials in terms of back stable Schubert polynomials. We also provide pipe dream interpretations for the rules originally given by Lenart (Grothendieck to Schubert) and Lascoux (Schubert to Grothendieck), which were previously formulated in terms of binary triangular arrays. We give new proofs of these results, relying on Knutson's co-transition recurrences. As a consequence, we obtain a formula…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Polynomial and algebraic computation · Commutative Algebra and Its Applications
