Related papers: Constructing maximal pipedreams of double Grothend…
Pipedreams and bumpless pipedreams are two combinatorial models that compute double Grothendieck polynomials. While studying matrix Schubert varieties, Pechenik, Speyer, and Weigandt defined a permutation statistic$\mathsf{rajcode}(\cdot)$…
The Castelnuovo-Mumford polynomial $\widehat{\mathfrak{G}}_w$ with $w \in S_n$ is the highest homogeneous component of the Grothendieck polynomial $\mathfrak{G}_w$. Pechenik, Speyer and Weigandt define a statistic $\mathsf{rajcode}(\cdot)$…
Recent work of Pechenik, Speyer, and Weigandt proved a formula for the degree of any Grothendieck polynomial. A distinct formula for the degree of vexillary Grothendieck polynomials was proven by Rajchgot, Robichaux, and Weigandt. We give a…
In this paper we show that the pipe dream complex associated to the permutation 1n(n-1)...2 can be geometrically realized as a triangulation of the vertex figure of a root polytope. Leading up to this result we show that the Grothendieck…
A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck…
The Cauchy identity gives a recipe for decomposing a double Grothendieck polynomial $\mathfrak{G}^{(\beta)}_w(x;y)$ as a sum of products $\mathfrak{G}^{(\beta)}_v(x)\mathfrak{G}^{(\beta)}_u(y)$ of single Grothendieck polynomials.…
We study random permutations arising from reduced pipe dreams. Our main model is motivated by Grothendieck polynomials with parameter $\beta=1$ arising in K-theory of the flag variety. The probability weight of a permutation is proportional…
Lascoux and Sch\"utzenberger 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…
In their work on the infinite flag variety, Lam, Lee, and Shimozono (2018) introduced objects called bumpless pipe dreams and used them to give a formula for double Schubert polynomials. We extend this formula to the setting of K-theory,…
We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…
Pipedreams are combinatorial objects that compute Grothendieck polynomials. We introduce a new combinatorial object that naturally recast the pipedream formula. From this, we obtain the first direct combinatorial formula for the top degree…
We construct a bijection between marked bumpless pipedreams with reverse compatible pairs, which are in bijection with not-necessarily-reduced pipedreams. This directly unifies various formulas for Grothendieck polynomials in the…
We construct an integrable colored six-vertex model whose partition function is a double Grothendieck polynomial. This gives an integrable systems interpretation of bumpless pipe dreams and recent results of Weigandt [arXiv:2003.07342]…
A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.
Knutson and Zinn-Justin recently found a puzzle rule for the expansion of the product $\mathfrak{G}_{u}(x,t)\cdot \mathfrak{G}_{v}(x,t)$ of two double Grothendieck polynomials indexed by permutations with separated descents. We establish…
We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…
Schubert polynomials are distinguished representatives of Schubert cycles in the cohomology of the flag variety. In the spirit of Bergeron and Sottile, we use the Bruhat order to give $(n-1)!$ different combinatorial formulas for the…
We show that the support of the Grothendieck polynomial $\mathfrak G_w$ of any fireworks permutation is as large as possible: a monomial appears in $\mathfrak G_w$ if and only if it divides $\mathbf x^{\mathrm{wt}(\overline{D(w)})}$ and is…
Recently Galashin, Grinberg, and Liu introduced the refined dual stable Grothendieck polynomials, which are symmetric functions in $x=(x_1,x_2,\dots)$ with additional parameters $t=(t_1,t_2,\dots)$. The refined dual stable Grothendieck…
In this paper, we establish a new geometric setting for bumpless pipe dreams and double Schubert polynomials. Building on the notion of bumpless pipe dream fragments, we define clan polynomials as their weight generating functions. It turns…