[Paper Review] Bijective Proofs of Monk's rule for Schubert and Double Schubert Polynomials with Bumpless Pipe Dreams

Daoji Huang|arXiv (Cornell University)|Oct 28, 2020

Advanced Combinatorial Mathematics4 citations

TL;DR

This paper presents the first bijective proofs of Monk's rule for both single and double Schubert polynomials using bumpless pipe dreams, introducing decorated bumpless pipe dreams with binary labels on blank tiles to handle the double Schubert polynomial case. The key contribution is a constructive, reversible bijection between pipe dream sets that encodes the algebraic identity combinatorially, extending prior results on transition and cotransition formulas and establishing a bridge between ordinary and bumpless pipe dreams via reverse induction.

ABSTRACT

We give bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double Schubert polynomials, which can be used to establish bijections with ordinary pipe dreams.

Motivation & Objective

• To provide a bijective proof of Monk’s rule for single Schubert polynomials using bumpless pipe dreams, extending known results from ordinary pipe dreams.
• To generalize the bijective framework to double Schubert polynomials by introducing decorated bumpless pipe dreams with binary labels on blank tiles.
• To establish a constructive bijection that preserves row-wise blank tile counts except for a controlled increase in row α, matching the algebraic structure of Monk’s rule.
• To recover transition and cotransition formulas as special cases of Monk’s rule, thereby unifying and extending previous bijective constructions.
• To demonstrate a reverse induction construction that yields a shape-preserving bijection between ordinary pipe dreams and bumpless pipe dreams, using cotransition maps.

Proposed method

• Introduce decorated bumpless pipe dreams by assigning binary labels (x or -y) to blank tiles to model double Schubert polynomials.
• Define a modified droop/undroop move that respects the decoration labels, allowing local tile transformations that preserve the monomial weight.
• Construct a reversible map Φπ between disjoint unions of bumpless pipe dreams that encodes Monk’s rule, with row α gaining one blank tile and other rows preserving their blank tile count.
• Use the droop operation to simulate multiplication by xα in the Schubert polynomial ring, with the decoration determining whether the monomial weight gains xα or -yj.
• Adapt existing droop move algorithms from [LLS18] and [Wei20] by incorporating decoration tracking and conditional placement based on label (x or -y).
• Prove the map is a bijection by showing it is invertible and preserves the monomial weight, with the decoration ensuring correct sign and variable tracking in the double polynomial case.

Experimental results

Research questions

• RQ1 Can Monk’s rule for double Schubert polynomials be given a bijective proof using bumpless pipe dreams, given the absence of such constructions in prior work?
• RQ2 How can decorated bumpless pipe dreams—featuring binary labels on blank tiles—be used to model the double Schubert polynomial expansion?
• RQ3 Is there a constructive, reversible bijection between the pipe dream sets on both sides of Monk’s rule that preserves row-wise blank tile counts except for a controlled increase in row α?
• RQ4 Can the cotransition and transition formulas for double Schubert polynomials be recovered as special cases of this bijective Monk’s rule construction?
• RQ5 What is the relationship between ordinary pipe dreams and bumpless pipe dreams, and can a bijection be established via reverse induction using cotransition maps?

Key findings

• The paper provides the first bijective proof of Monk’s rule for double Schubert polynomials using decorated bumpless pipe dreams, resolving a long-standing gap in combinatorial Schubert calculus.
• A new construction of decorated bumpless pipe dreams with binary labels (x or -y) on blank tiles successfully models the double Schubert polynomial as a sum over such diagrams.
• The proposed map Φπ is a well-defined, invertible bijection between disjoint unions of bumpless pipe dreams that encodes the algebraic identity of Monk’s rule, with precise control over blank tile counts per row.
• The construction recovers the transition and cotransition formulas as special cases: the transition formula when only one l satisfies πtα,l ≻ π, and the cotransition when no k < α satisfies πtα,k ≻ π.
• By combining the cotransition bijections for ordinary and bumpless pipe dreams, the paper establishes a reverse induction construction that yields a shape-preserving bijection between ordinary and bumpless pipe dreams.
• The method extends prior work by Weigandt (2020) and Knutson (2019), unifying bijective proofs across different pipe dream models and providing a new framework for future combinatorial Schubert calculus.