---
abstract: 'Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the $h^\ast$-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomials. In both cases, we prove that these polytopes have the integer decomposition property by using the fact that both families of polynomials have saturated Newton polytope. Furthermore, in both cases, we provide a complete characterization of when these polytopes are reflexive. We conclude with some explicit formulas and unimodality implications of the $h^\ast$-vector in the case of Schur polynomials.'
author:
- |
    Margaret Bayer, Bennet Goeckner, Su Ji Hong, Tyrrell McAllister,\
    McCabe Olsen, Casey Pinckney, Julianne Vega, and Martha Yip
bibliography:
- 'biblio.bib'
title: Lattice polytopes from Schur and symmetric Grothendieck polynomials
---

Introduction
============

Of central interest in algebraic combinatorics are polynomials $f \in \mathbb{C}[x_1,x_2,\dots, x_m]$, which commonly appear as generating functions that encode some combinatorial information. 