English

Newton polytopes of fireworks Grothendieck polynomials

Combinatorics 2025-08-14 v2

Abstract

We show that the support of the Grothendieck polynomial Gw\mathfrak G_w of any fireworks permutation is as large as possible: a monomial appears in Gw\mathfrak G_w if and only if it divides xwt(D(w))\mathbf x^{\mathrm{wt}(\overline{D(w)})} and is divisible by some monomial appearing in the Schubert polynomial Sw\mathfrak S_w. Our formula implies that the homogenization of Gw\mathfrak G_w has M-convex support. We also show that for any fireworks permutation wSnw\in S_n, there exists a layered permutation π(w)Sn\pi(w)\in S_n so that supp(Gπ(w))supp(Gw)\mathrm{supp}(\mathfrak G_{\pi(w)})\supseteq \mathrm{supp}(\mathfrak G_w).

Keywords

Cite

@article{arxiv.2508.09107,
  title  = {Newton polytopes of fireworks Grothendieck polynomials},
  author = {Jack Chen-An Chou and Linus Setiabrata},
  journal= {arXiv preprint arXiv:2508.09107},
  year   = {2025}
}

Comments

15 pages, 8 figures. v2: edits to arXiv metadata