Lattice-free Schubitopes

TL;DR

This paper characterizes when Schubitope polytopes are lattice-free, linking this property to Ehrhart polynomials and pattern avoidance in permutations, with applications to Schubert and Grothendieck polynomials.

Contribution

It provides a simple criterion for lattice-freeness of Schubitopes and establishes a connection to Ehrhart polynomials and permutation pattern avoidance.

Findings

Schubitope is lattice-free iff its Ehrhart polynomial factors as a product of Schubert matroid Ehrhart polynomials.

Newton polytopes of Schubert and Grothendieck polynomials are lattice-free if and only if the permutation avoids certain patterns.

Confirmed conjectures on the support of Grothendieck polynomials for pattern-avoiding permutations.

Abstract

In this paper, we provide a simple criterion for the Schubitope $\mathcal{S}_{D}$ associated to a diagram $D$ to be lattice-free. We further show that $\mathcal{S}_{D}$ is lattice-free if and only if its Ehrhart polynomial is equal to the product of Ehrhart polynomials of the Schubert matroid polytopes corresponding to each column of $D$. As applications, we obtain that the Newton polytopes of the Schubert polynomial $\mathfrak{S}_w(x)$ and the Grothendieck polynomial $\mathfrak{G}_w(x)$ are lattice-free if and only if $w$ avoids the patterns 1423, 1432, 13254, and confirm several conjectures by M\'esz\'aros, Setiabrata, and St.Dizier on the support of Grothendieck polynomials for this class of permutations.