Search arXivSearch

arXiv · 2506.07306

Changing Bases with Pipe Dream Combinatorics

Abstract

Lascoux and Schützenberger introduced Schubert and Grothendieck polynomials to study the cohomology and K-theory of the complete flag variety. We present explicit combinatorial rules for expressing Grothendieck polynomials in the basis of Schubert polynomials, and vice versa, using the bumpless pipe dreams (BPDs) of Lam, Lee, and Shimozono. A key advantage of BPDs is that they are naturally back stable, which allows us to give a combinatorial formula for expanding back stable Grothendieck polynomials in terms of back stable Schubert polynomials. We also provide pipe dream interpretations for the rules originally given by Lenart (Grothendieck to Schubert) and Lascoux (Schubert to Grothendieck), which were previously formulated in terms of binary triangular arrays. We give new proofs of these results, relying on Knutson's co-transition recurrences. As a consequence, we obtain a formula for expanding Grothendieck polynomials into Schubert polynomials using chains in Bruhat order. The key connection between the pipe dream and BPD change of basis formulas is the canonical bijection of Gao and Huang. We show that co-permutations are preserved by this map.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Weigandt. 2025-06-08. Changing Bases with Pipe Dream Combinatorics. https://arxiv.org/abs/2506.07306

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

KEEP EXPLORING

Related papers

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

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