Reduced Pipe Dreams in Schubert Theory

• Reduced pipe dreams are combinatorial encodings of permutations realized as tilings with crosses and elbows where each pair of strands crosses at most once.
• They play a central role in Schubert and Grothendieck polynomial theory by generating key polynomial expansions, facilitating bijections with structures like TSSCPP and ASMs, and supporting Demazure crystal frameworks.
• Their applications extend to probabilistic models and generalizations to classical Weyl groups, influencing integrable probability and random permutation statistics.

Searching arXiv for recent and foundational papers on reduced pipe dreams and closely related developments. Reduced pipe dreams are combinatorial encodings of permutations, traditionally realized as tilings by crosses and elbows in which the induced strands cross at most once pairwise. They occupy a central position in the combinatorics of Schubert and Grothendieck polynomials, where they function both as generating objects for polynomial expansions and as interfaces to compatible sequences, bumpless pipe dreams, crystal structures, and, more recently, probabilistic models. In the literature summarized here, reduced pipe dreams appear simultaneously as enumerative devices for Schubert calculus, as the reduced sector of broader pipe-dream formalisms, and as the structural backbone for bijections, pattern-avoidance results, and representation-theoretic constructions (Gao et al., 2021, Gold et al., 2024, Huang et al., 2023).

1. Definition and basic combinatorial model

For $\pi\in S_\infty$, a pipe dream, also called an RC-graph, is a tiling of the positive quadrant by cross tiles and elbow tiles, with finitely many crosses, such that pipes enter from the north border and exit to the west border, and pipe $i$ ends at row $\pi(i)$ (Gao et al., 2021). In a finite staircase model, one works in the staircase Young diagram $(n-1,n-2,\dots,1)$, with each box filled by either a cross or an elbow, and with the associated strands read as a wiring diagram (Smirnov et al., 2020). The standard reducedness condition is that no two pipes cross twice, or equivalently that each pair of strands crosses at most once (Gao et al., 2021, Smirnov et al., 2020).

The set of reduced pipe dreams of $\pi$ is denoted $PD(\pi)$ in (Gao et al., 2021), while (Gold et al., 2024) writes $RP(w)$ for the set of reduced pipe dreams for $w\in S_n$. For a reduced pipe dream $D$, the set of cross positions is $cross(D)$, and the weight is

$i$0

This row-weight convention is the standard one used in the Schubert-polynomial expansion (Gao et al., 2021).

A compatible-sequence description is built into the model. A compatible sequence of $i$1 is a pair

$i$2

with $i$3, such that $i$4 is a reduced word of $i$5, $i$6, $i$7 for all $i$8, and $i$9 whenever $\pi(i)$0 (Gao et al., 2021). If the crosses of $\pi(i)$1 are ordered from top to bottom, and within each row from right to left, as

$\pi(i)$2

then

$\pi(i)$3

Equivalently, the cross at $\pi(i)$4 corresponds to the simple transposition $\pi(i)$5 (Gao et al., 2021). This identifies reduced pipe dreams and compatible sequences combinatorially.

The same row-by-row and right-to-left reading convention also underlies the reduced-pipe-dream formula for Schubert polynomials in (Gold et al., 2024). There, if the crosses in a pipe dream $\pi(i)$6 are listed row by row from top to bottom, and from right to left within each row, one obtains a reduced word $\pi(i)$7 by recording $\pi(i)$8 for each cross $\pi(i)$9, together with the compatible sequence $(n-1,n-2,\dots,1)$0 recording the row indices. This is described as the classical rc-graph/pipedream correspondence of Bergeron–Billey and Fomin–Kirillov (Gold et al., 2024).

2. Role in Schubert and Grothendieck polynomial theory

Reduced pipe dreams provide the standard positive combinatorial expansion of Schubert polynomials. In (Gao et al., 2021), the Schubert polynomial satisfies

$(n-1,n-2,\dots,1)$1

The equivalent formulation in (Gold et al., 2024) is

$(n-1,n-2,\dots,1)$2

where $(n-1,n-2,\dots,1)$3 is the weak composition whose $(n-1,n-2,\dots,1)$4-th part is the number of crosses in row $(n-1,n-2,\dots,1)$5 of $(n-1,n-2,\dots,1)$6. Thus each reduced pipe dream contributes one monomial, and the Schubert polynomial is the generating function over all such monomials (Gold et al., 2024).

This expansion is related to the older reduced-word/compatible-sequence description

$(n-1,n-2,\dots,1)$7

and the reduced-pipe-dream model is the geometric-combinatorial realization of that formula (Gold et al., 2024).

Reducedness becomes a deformation parameter boundary in Grothendieck-polynomial theory. In (Morales et al., 2024), the pipe-dream formula is

$(n-1,n-2,\dots,1)$8

where $(n-1,n-2,\dots,1)$9 now denotes all pipe dreams encoding $\pi$0. The reduced sector is recovered at $\pi$1, because only reduced pipe dreams contribute: $\pi$2 This places reduced pipe dreams as the Schubert-theoretic specialization of a larger Grothendieck-theoretic model (Morales et al., 2024).

A different extension appears in the theory of padded Schubert polynomials. For a dominant permutation $\pi$3, (Dennin, 16 Aug 2025) fixes a partition $\pi$4 and defines the associated padded Schubert polynomial by

$\pi$5

for $\pi$6. The paper then gives a pipe-dream formula

$\pi$7

where $\pi$8 is a distinguished subset of $\pi$9-dominated positions in the pipe dream. Although this formulation uses $PD(\pi)$0, the starting point is explicitly “the usual Schubert polynomial $PD(\pi)$1, defined combinatorially by pipe dreams,” with “reduced” meaning no two pipes cross more than once (Dennin, 16 Aug 2025). This suggests that reduced pipe dreams remain the organizing model even when additional $PD(\pi)$2-weights and differential operators are introduced.

3. Compatible sequences, pseudo-Yamanouchi conditions, and TSSCPP

A notable recent use of reduced pipe dreams is the reinterpretation of totally symmetric self-complementary plane partitions (TSSCPP) in pipe-dream language (Huang et al., 2023). The paper characterizes TSSCPP as bounded compatible sequences satisfying a Yamanouchi-like condition and thereby puts them in bijection with certain pipe dreams (Huang et al., 2023).

The construction starts from the boolean-triangle model for $PD(\pi)$3, encoded by a triangular array $PD(\pi)$4 with entries in $PD(\pi)$5, indexed by

$PD(\pi)$6

subject to the diagonal partial-sum inequalities

$PD(\pi)$7

Huang and Striker flip the triangle vertically and left-justify it by defining

$PD(\pi)$8

then interpret each $PD(\pi)$9 as a cross tile and each $RP(w)$0 as an elbow tile in the triangular region of a pipe dream (Huang et al., 2023).

Under this translation, the diagonal-sum inequalities become a local condition equivalent to a pseudo-Yamanouchi counting rule on the associated bounded compatible sequence. If a pipe dream corresponds to

$RP(w)$1

then it must satisfy

$RP(w)$2

and is pseudo-Yamanouchi if for all $RP(w)$3 and all $RP(w)$4,

$RP(w)$5

where $RP(w)$6 is the number of entries equal to $RP(w)$7 among $RP(w)$8 (Huang et al., 2023). The key characterization is

$RP(w)$9

and this bijection preserves weight (Huang et al., 2023).

Reduced pipe dreams enter decisively when the paper imposes pattern avoidance. A theorem of Gao states that if $w\in S_n$0 avoids $w\in S_n$1, then any two reduced pipe dreams of $w\in S_n$2 are connected by simple slides. Huang and Striker prove that pseudo-Yamanouchi-ness is preserved under simple slides and show that the bottom pipe dream is pseudo-Yamanouchi. Hence for $w\in S_n$3-avoiding permutations, every reduced pipe dream of $w\in S_n$4 is pseudo-Yamanouchi, giving

$w\in S_n$5

This is the reduced, $w\in S_n$6-avoiding TSSCPP model (Huang et al., 2023).

A plausible implication is that reducedness here is not merely technical: it isolates the sector in which the local slide dynamics is sufficiently rigid to identify all reduced realizations with the TSSCPP-compatible condition.

4. Canonical bijection with reduced bumpless pipe dreams and ASM correspondences

Reduced pipe dreams are linked canonically to reduced bumpless pipe dreams in (Gao et al., 2021). A reduced bumpless pipe dream is a tiling by six tile types encoding pipes that travel from $w\in S_n$7 to $w\in S_n$8 in a northeast direction, with reducedness again meaning that no two pipes cross twice (Gao et al., 2021). The set is denoted $w\in S_n$9, and its weight is

$D$0

Lam–Lee–Shimozono’s theorem gives

$D$1

so reduced bumpless pipe dreams and reduced pipe dreams both enumerate the same Schubert polynomial (Gao et al., 2021).

The central result of (Gao et al., 2021) is a direct, explicit, weight-preserving bijection

$D$2

The map is constructed by iterating a “pop” operation on bumpless pipe dreams. Given $D$3, one repeatedly finds the smallest row index $D$4 containing a blank tile, marks the rightmost blank tile in that row, performs a sequence of local moves, and obtains $D$5 while recording $D$6. Iterating this yields

$D$7

where

$D$8

The output is exactly a compatible sequence, hence a reduced pipe dream (Gao et al., 2021).

The paper further proves canonicity by showing that $D$9 preserves Monk’s rule. Equivalently,

$cross(D)$0

This shows that the bijection is not just weight-preserving but structurally compatible with Schubert-calculus recursions (Gao et al., 2021).

This bijection becomes a bridge to alternating sign matrices (ASM) in (Huang et al., 2023). Gao–Huang give a direct bijection

$cross(D)$1

preserving weight, and under the usual ASM–BPD correspondence, blank tiles correspond exactly to the NW-zero positions of the ASM. Consequently,

$cross(D)$2

agrees with the BPD weight (Huang et al., 2023). Combining the TSSCPP-to-pipe-dream translation with the reduced BPD-to-pipe-dream bijection yields, for every permutation $cross(D)$3, an explicit weight-preserving injection

$cross(D)$4

If $cross(D)$5 avoids $cross(D)$6, the map is a bijection: $cross(D)$7 For permutations avoiding both $cross(D)$8 and $cross(D)$9, the paper constructs a different bijection preserving natural poset structures (Huang et al., 2023).

The same paper defines $i$00, the poset of reduced pipe dreams of $i$01, ordered by simple slides starting from the bottom pipe dream. In the $i$02- and $i$03-avoiding case, the bumpless-pipe-dream droop poset decomposes as a product of slide posets and dual slide posets: $i$04 This yields

$i$05

with the corresponding product-poset structure preserved (Huang et al., 2023).

5. Crystal operators and Demazure-crystal structure

Reduced pipe dreams support a Demazure crystal structure when Bergeron–Billey chute moves are restricted appropriately (Gold et al., 2024). The paper begins from the reduced-pipe-dream expansion of the Schubert polynomial and then defines crystal operators by a pairing process between adjacent rows.

Fix $i$06. Starting from the rightmost cross in row $i$07, one looks for an unpaired cross in row $i$08 lying weakly to the right, choosing the leftmost such cross if there are several; if found, the two crosses are paired. Moving leftward through row $i$09 leaves some crosses unpaired (Gold et al., 2024). The lowering operator $i$10 moves the leftmost unpaired cross in row $i$11 down to row $i$12, jumping over a maximal rectangle of adjacent crosses. If $i$13 is the leftmost unpaired cross in row $i$14, then one finds $i$15 such that

$i$16

and defines

$i$17

If there is no unpaired cross, or if all tiles to the left are already crosses, then $i$18. The raising operator $i$19 is the inverse move (Gold et al., 2024).

These operators are well-defined on reduced pipe dreams and satisfy

$i$20

and

$i$21

with $i$22 and $i$23 mutually inverse on nonzero images (Gold et al., 2024). The main theorem states that for any $i$24, the operators $i$25 and $i$26 define a type $i$27 Demazure crystal structure on $i$28. In particular,

$i$29

where $i$30 is the truncating permutation attached to the highest weight pipe dream $i$31 (Gold et al., 2024).

Highest weight pipe dreams are exactly those annihilated by all $i$32. The paper proves that if $i$33 is highest weight, then $i$34 is a partition. Each connected component under the crystal moves is a Demazure crystal generated from a highest weight pipe dream, and the monomials of $i$35 are partitioned into crystal components whose characters are key polynomials. Consequently,

$i$36

where the composition $i$37 is uniquely determined by the highest weight pipe dream $i$38 (Gold et al., 2024).

A weight-preserving bijection

$i$39

to reduced factorizations with cutoff transports the Assaf–Schilling crystal structure back to reduced pipe dreams. The paper proves that $i$40 preserves the pairing process and intertwines the lowering and raising operators: $i$41 This identifies the restricted chute moves as crystal operators rather than merely local combinatorial moves (Gold et al., 2024).

This suggests that reduced pipe dreams constitute a particularly rigid realization of Schubert combinatorics: the same objects support polynomial enumeration, reduced-word encoding, and a full Demazure-crystal structure.

6. Extensions, probabilistic models, and generalized settings

Reduced pipe dreams are the type $i$42 prototype for a broader family of pipe-dream models. In (Smirnov et al., 2020), the model is extended uniformly to the classical Weyl groups $i$43, $i$44, and $i$45 by introducing signed pipe dreams with $i$46-blocks and faucets. The central formulas are

$i$47

$i$48

$i$49

These generalize the type $i$50 identity

$i$51

The paper also proves the existence and uniqueness of a bottom pipe dream in each classical type (Smirnov et al., 2020). Reduced pipe dreams in type $i$52 are therefore the base case of a larger Coxeter-theoretic framework rather than an isolated construction.

A different generalization appears in the study of random permutations arising from pipe dreams (Morales et al., 2024). Fix $i$53 and the staircase

$i$54

Each box is independently filled by a cross with probability $i$55 and an elbow with probability $i$56, producing one of the $i$57 pipe dreams of order $i$58. A reduction procedure replaces any crossing of two pipes that have already crossed earlier by an elbow, producing a unique reduced pipe dream $i$59. The associated permutation $i$60 is defined from this reduction (Morales et al., 2024).

The probability of a given permutation is

$i$61

which becomes

$i$62

Thus the law of the random permutation is governed by $i$63 Grothendieck polynomials under principal specialization (Morales et al., 2024).

The paper proves that this model is equivalent to a colored stochastic six-vertex model and, after forgetting colors, to a discrete-time TASEP with parallel update and geometric jumps. For the permutation height function

$i$64

one obtains a deterministic limit shape, a limiting permuton, and $i$65-scale Tracy–Widom GUE fluctuations in the curved region (Morales et al., 2024). Although the random model begins with arbitrary pipe dreams, the reduction procedure shows that reduced pipe dreams are again the canonical representatives of permutation data.

The same paper also studies the $i$66 non-reduced model, where one reads the permutation from the raw random tiling without resolving double crossings. There the inversion number is of order $i$67, and the permuton converges to the identity permuton (Morales et al., 2024). This sharp contrast clarifies the structural role of reducedness: passing to reduced pipe dreams changes both the algebraic interpretation and the asymptotic permutation statistics.

7. Structural themes and common misconceptions

Several recurring themes organize the modern theory of reduced pipe dreams.

First, reduced pipe dreams are not merely one model among many for Schubert polynomials. They are linked explicitly to compatible sequences (Gao et al., 2021), to reduced factorizations with cutoff (Gold et al., 2024), to reduced bumpless pipe dreams via a canonical bijection (Gao et al., 2021), and to TSSCPP and ASM in pattern-avoiding regimes (Huang et al., 2023). The same objects support polynomial, bijective, and crystal-theoretic formalisms.

Second, reducedness is stronger than a convenience condition. In the standard definition, it means that no two pipes cross twice (Gao et al., 2021, Gold et al., 2024). In Grothendieck-theoretic settings, non-reduced pipe dreams contribute only when the deformation parameter allows them; at $i$68, the Schubert specialization forces the reduced sector (Morales et al., 2024). In TSSCPP-related work, reducedness is the regime in which slide connectivity and pattern avoidance yield clean bijections (Huang et al., 2023).

Third, reduced pipe dreams should not be conflated with bumpless pipe dreams. The latter are distinct tiling objects with six tile types and blank-tile weights (Gao et al., 2021). Their equivalence with reduced pipe dreams is highly nontrivial and is established by an explicit bijection $i$69, not by identification of definitions (Gao et al., 2021).

Fourth, local moves on pipe dreams come in different forms with different purposes. Bergeron–Billey chute moves, simple slides, and Monk moves are not interchangeable notions. In (Gold et al., 2024), restricted chute moves define crystal operators; in (Huang et al., 2023), simple slides organize reduced pipe dreams into posets and preserve pseudo-Yamanouchi-ness under pattern avoidance; in (Gao et al., 2021), Monk moves are the operators relevant for canonicity of the BPD–PD bijection. A plausible implication is that much of the current literature distinguishes reduced-pipe-dream structures not by the underlying tilings but by the local move systems imposed on them.

Finally, reduced pipe dreams now function as a nexus connecting algebraic combinatorics, Schubert calculus, representation theory, and integrable probability. In the available literature, they generate Schubert polynomials (Gao et al., 2021), decompose into Demazure crystal components (Gold et al., 2024), mediate bijections with TSSCPP, ASM, and bumpless pipe dreams (Huang et al., 2023, Gao et al., 2021), generalize to classical Weyl groups (Smirnov et al., 2020), and arise as the reduced images of random pipe-dream models with KPZ asymptotics (Morales et al., 2024). This combination of exact combinatorial control and extensibility explains their continuing prominence in current research.