Lattice-free Schubitopes
Combinatorics
2026-05-12 v1
Abstract
In this paper, we provide a simple criterion for the Schubitope associated to a diagram to be lattice-free. We further show that 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 . As applications, we obtain that the Newton polytopes of the Schubert polynomial and the Grothendieck polynomial are lattice-free if and only if 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.
Keywords
Cite
@article{arxiv.2605.10016,
title = {Lattice-free Schubitopes},
author = {Jinren Dou and Neil J. Y. Fan and Kunwen Liu},
journal= {arXiv preprint arXiv:2605.10016},
year = {2026}
}
Comments
17 pages