Permutations with only reduced co-BPDs
Joshua Arroyo, Adam Gregory
TL;DR
This work characterizes precisely which permutations have only reduced co-BPDs in the bumpless pipe dream framework relating Grothendieck and Schubert polynomials. It introduces the pattern set $\{1423,12543,13254,25143,215643,216543,241653\}$ and proves both directions: avoidance of these patterns by $w$ guarantees all co-BPDs are reduced, while presence of any pattern yields a non-reduced co-BPD, via configuration lemmas and explicit droop-move constructions. The approach connects geometric configurations of elbows and blocking pipes to classical permutation patterns, enabling a checkable criterion for co-BPD reduction. Consequently, for pattern-avoiding $w$, every co-BPD contributes positively to the structure of the Grothendieck–Schubert expansions, with corollaries regarding reversals and vexillary cases that illuminate the interplay between combinatorics and K-theoretic/schubert theory.
Abstract
Bumpless pipe dreams (BPDs) are combinatorial objects used in the study of Schubert and Grothendieck polynomials. Weigandt recently introduced a co-BPD object associated to each BPD and used them to give an analogue to the change of bases formulas of Lenart and Lascoux between these polynomials. She posed the problem of characterizing the set of permutations whose BPDs have only reduced co-BPDs. We give a pattern-avoidance characterization for these permutations using a set of seven patterns.
