Ehrhart polynomial and Successive Minima
Martin Henk, Achill Schuermann, Joerg M. Wills
Abstract
We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean n-space Rn. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related by their geometric and arithmetic mean. We also show that the roots of lattice n-polytopes with or without interior lattice points differ essentially. Furthermore, we study the structure of the roots in the planar case. Here it turns out that their distribution reflects basic properties of lattice polygons.
Create a lesson
Related papers
Each simplex in R4 has a point with at least 14 emanating normals to its boundary
Ivan Nasonov, Gaiane Panina
Pointed Gromov-Hausdorff Distance between lp-Wedge Sums and Isometric Embeddings of l∞
Emin Abdullaev
Embedding large subsets of Wasserstein spaces into Banach spaces
Cyril Letrouit, Quentin Mérigot
A Smooth Covariogram and the Transition Between Projection Bodies
J. Haddad, C. H. Jiménez, M. Resende Guedes
Intermediate coverings, random images, and projections
Yunhao Zhao, Yingyu Zhao, Chen Zhou et al.
On the Graph Corresponding to Center of Distances of Metric Space
Oleksiy Dovgoshey, Olga Rovenska