---
title: Reduced Bumpless Pipe Dreams
url: https://www.emergentmind.com/topics/reduced-bumpless-pipe-dreams-rbpd
type: topic
---

# Reduced Bumpless Pipe Dreams

A reduced bumpless pipe dream (RBPD) is a combinatorial object serving as a canonical representative of permutations in $S_n$ and providing a geometric and algebraic framework for understanding Schubert polynomials. RBPDs are distinguished by their tiling rules on an $n\times n$ grid with six tile types and strict reducedness—each pair of pipes crosses at most once. RBPDs offer a fundamentally different, yet dual, approach to classical reduced pipe dreams, bridging contemporary combinatorial models and deep results in algebraic geometry, symmetric functions, and statistical mechanics.

## 1. Definitions and Fundamental Properties

An RBPD of size $n$ is a filling of an $n\times n$ square grid by six tile types: horizontal, vertical, two “bumpless” elbows (NW and SE turns), cross, and blank, subject to “domain wall” boundary conditions. Colored pipes labeled $k$ enter from the south at column $k$ and exit on the east at row $k$; the entire system forms $n$ nonintersecting paths. Reducedness mandates that each pair of pipes crosses at most once. For each RBPD $D$, the permutation $w \in S_n$ is determined by the exit order.

RBPDs are closely related to alternatingsign matrices (ASM) in the unreduced case. However, the reduced set fails to inherit the sublattice property inherent to ASMs: the meet of two reduced BPDs in the ASM lattice need not be reduced, with the first failures at $n=4$ [2603.20104, 2303.10463].

## 2. Connections to Schubert Polynomials

RBPDs encode monomials in the (single or double) Schubert polynomial $\mathfrak{S}_w(\mathbf{x}, \mathbf{y})$. Lam–Lee–Shimozono and Weigandt proved that:

\[
\mathfrak{S}_w(\mathbf{x},\mathbf{y}) = \sum_{\,\mathcal{B}\colon \w_{\mathcal{B}}=w} \prod_{(i,j)\in D(\mathcal{B})} (x_i - y_j)
\]

where $D(\mathcal{B})$ is the set of blank tiles in $\mathcal{B}$. The ordinary Schubert polynomial arises by $y=0$, yielding

\[
\mathfrak{S}_w(x_1,\dots,x_n) = \sum_{\mathcal{B}\in\mathrm{RBPD}(w)}\prod_{(i,j) \in D(\mathcal{B})} x_i.
\]

The principal specialization $\mathfrak{S}_w(1,1,\ldots,1)$ enumerates RBPDs of given boundary permutation $w$. The geometric underpinning is a diagonal Gröbner degeneration of matrix Schubert varieties, with RBPDs indexing the irreducible components and the weight recording scheme-theoretic multiplicity [2108.08370, 2303.10463].

## 3. Enumerative Recurrences and Asymptotics

For $\Upsilon_w = \mathfrak{S}_w(1^n)$, three core recurrences exist:

- **Descent formula (Macdonald):**
  
  \[
  \Upsilon_w = \sum_{i\in \mathrm{Des}(w)} \frac{i}{\ell(w)} \Upsilon_{w\cdot s_i}
  \]
  with $\Upsilon_e=1$.

- **Transition formula (Lascoux-Schützenberger):** Recursive on $132$-patterns, reducing to $\Upsilon_w=1$ for dominant $w$.

- **Cotransition formula (Knutson):** Recurrence on Bruhat covers altering a minimal position, with $\Upsilon_{w_0}=1$.

A remarkable enumerative result is that for $w$ varying over $S_n$, the maximal value of $\Upsilon_w$ need not be achieved for a layered permutation: counterexamples occur for $n=17$ onward, disproving the Merzon–Smirnov conjecture. Yet, simulations suggest that the asymptotic growth rate of $\max_w \Upsilon_w$ matches that for maximal layered permutations, i.e.,

\[
\lim_{n\to\infty} \frac{1}{n^2}\log_2\left( \max_{w\in S_n} \Upsilon_w \right) \approx 0.29
\]

[2603.20104].

## 4. Algorithmic and Combinatorial Structures

### 4.1. Local Moves and Sampling

RBPDs admit two central types of local moves:

- **$2 \times 2$ Flips:** Drip, annihilation/creation, and relocation moves analogous to six-vertex model updates, preserving reducedness.
- **Droop/Undroop Moves:** For rectangles $R$, a “droop” rearranges elbows and pipes globally while maintaining the permutation and reducedness. Any RBPD can be reached from its Rothe BPD using droops alone (Lam–Lee–Shimozono), and the combination of droops and $2\times2$ flips is ergodic [2108.08370, 2603.20104].

### 4.2. Markov Chain Monte Carlo (MCMC) and Lattice Structure

Exact uniform sampling via monotone Coupling-From-The-Past (CFTP) fails for RBPDs because sublattice closure is lost: monotonicity of update maps is violated, leading to false coalescence of extremal chains. As a computational workaround, an MCMC sampler using a mixture of local ($2\times2$) and global (droop) updates achieves rapid mixing, with empirical burn-in $10^9$ steps at $n=60$ on personal computers. For $n=100$, coordinated parallel sampling yields fast, scalable enumeration and statistical analysis [2603.20104].

## 5. Canonical Bijection with Pipe Dreams and Additional Models

A canonical, weight-preserving bijection exists between reduced bumpless pipe dreams and reduced pipe dreams (Gao–Huang). This bijection arises by iteratively “popping” and column-rectifying blank tiles, extracting a reduced compatible sequence indexing the corresponding reduced pipe dream. The bijection commutes with Monk’s rule and extends to the double Schubert polynomial and back-stable settings [2108.11438, 2303.10463].

A unified puzzle model encodes both RBPDs and classical pipe dreams as edge cases of a larger “master” tiling, equipping the combinatorics with Yang–Baxter moves and recasting the divided-difference recurrences for Schubert polynomials in the language of tile-moves [2012.10909].

## 6. Broader Connections: ASMs, Plane Partitions, and Growth Diagrams

RBPDs are linked to ASMs (alternating sign matrices) via a bijection in the unreduced case, and refined bijections exist under pattern-avoidance for permutations. In particular, for $(1432,2143)$-avoiding $w$, RBPDs (and their associated ASMs) are related by explicit weight- and poset-preserving bijections to totally symmetric self-complementary plane partitions (TSSCPP), with the combinatorics of “droop” and “slide” moves mediating the correspondence [2303.10463].

Further, RBPDs serve as insertion objects in new RSK-type and growth diagram algorithms tailored for Schubert calculus, yielding positive, combinatorial rules for Schubert structure constants in separated-descent cases [2206.14351].

## 7. Open Problems and Computational Resources

Several directions remain active:

- **Connectivity** under $2\times2$ flips without droops: the full characterization of “trapped” configurations is unknown.
- **Mixing time estimates** for the droop-augmented Markov chain.
- **Asymptotic questions:** rigorous derivation of the “Schubert permuton,” “limit shape,” and analysis of fluctuation regimes (e.g., connection to Gaussian free fields).
- **Weighted specializations:** extension to $q$-specializations, Grothendieck and double Schubert polynomials, and development of corresponding fast samplers and theoretical analyses.

Code for enumeration (via all three recurrences) and sampling (including demonstration of CFTP failure and droop-augmented MCMC) is publicly available [2603.20104].

---

**References:**  
[2603.20104], [2108.08370], [2108.11438], [2012.10909], [2303.10463], [2206.14351]

Source: https://www.emergentmind.com/topics/reduced-bumpless-pipe-dreams-rbpd