Papers
Topics
Authors
Recent
2000 character limit reached

Lattice polytopes from Schur and symmetric Grothendieck polynomials

Published 19 May 2020 in math.CO | (2005.09628v3)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.