Search arXivSearch

arXiv · 2509.01857

Hybrid pipe dreams for the lower-upper scheme

Abstract

In [KU23] were introduced hybrid pipe dreams interpolating between classic and bumpless pipe dreams, each hybridization giving a different formula for double Schubert polynomials. A bijective proof was given (following [GH23]) of the independence of hybridization, but only for nonequivariant Schubert polynomials. In this paper we further generalize to hybrid generic pipe dreams, replacing the bijective proof of hybridization-independence with a Yang-Baxter-based proof that allows one to maintain equivariance. An additional YB-based proof establishes a divided-difference type recurrence for these generic pipe dream polynomials. These polynomials compute something richer than double Schubert polynomials, namely the equivariant classes of the lower-upper varieties introduced in [Knu05]. We give two proofs of this: the easier being a proof that the recurrence relation holds on those classes, the more difficult being a degeneration of the lower-upper variety to a union of quadratic complete intersections (plus, possibly, some embedded components) whose individual classes match those of the generic pipe dreams. One new feature of the generic situation is a definition of the "flux" through an edge of the matrix; the notion of pipe dream itself can then be derived from the equalities among the fluxes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Allen Knutson, Paul Zinn-Justin. 2025-09-02. Hybrid pipe dreams for the lower-upper scheme. https://arxiv.org/abs/2509.01857

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO