Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.08370

Bumpless pipe dreams encode Gröbner geometry of Schubert polynomials

Patricia Klein·Anna Weigandt
View original source ↗Read source document ↗Export metadata ↓

Abstract

In their study of infinite flag varieties, Lam, Lee, and Shimozono (2021) introduced bumpless pipe dreams in a new combinatorial formula for double Schubert polynomials. These polynomials are the TxT-equivariant cohomology classes of matrix Schubert varieties and of their flat degenerations. We give diagonal term orders with respect to which bumpless pipe dreams index the irreducible components of diagonal Gröbner degenerations of matrix Schubert varieties, counted with scheme-theoretic multiplicity. This indexing was conjectured by Hamaker, Pechenik, and Weigandt (2022). This result establishes that bumpless pipe dreams are dual to and as geometrically natural as classical pipe dreams, for which an analogous anti-diagonal theory was developed by Knutson and Miller (2005).

Explore related subjects

math.COmath.ACmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patricia Klein, Anna Weigandt. 2025-09-02. Bumpless pipe dreams encode Gröbner geometry of Schubert polynomials. https://arxiv.org/abs/2108.08370

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗