We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n2, where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun where it is shown that the norm of a root of a Ehrhart polynomial is at most of order n2. For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for crosspolytopes. We further give a characterisation of the roots of Ehrhart polyomials in the three-dimensional case and we classify for n ≤ 4 all lattice polytopes whose roots of their Ehrhart polynomials have all real part -1/2. These polytopes belong to the class of reflexive polytopes. © Springer 2007.
CITATION STYLE
Bey, C., Henk, M., & Wills, J. M. (2007). Notes on the roots of Ehrhart polynomials. Discrete and Computational Geometry, 38(1), 81–98. https://doi.org/10.1007/s00454-007-1330-y
Mendeley helps you to discover research relevant for your work.