Newton polytopes of fireworks Grothendieck polynomials
Jack Chen-An Chou, Linus Setiabrata

TL;DR
This paper investigates the structure of fireworks Grothendieck polynomials, revealing their support properties and convexity, and establishing relationships with layered permutations to understand their combinatorial and geometric features.
Contribution
It characterizes the support of fireworks Grothendieck polynomials, proves M-convexity of their homogenization, and relates their support to layered permutations, advancing understanding of their combinatorial structure.
Findings
Support of $rak G_w$ is as large as possible, determined by divisibility conditions.
Homogenization of $rak G_w$ has M-convex support.
Existence of layered permutation $ ilde{w}$ with support containing that of $w$.
Abstract
We show that the support of the Grothendieck polynomial of any fireworks permutation is as large as possible: a monomial appears in if and only if it divides and is divisible by some monomial appearing in the Schubert polynomial . Our formula implies that the homogenization of has M-convex support. We also show that for any fireworks permutation , there exists a layered permutation so that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Geometric and Algebraic Topology · Genome Rearrangement Algorithms
