Mathematika · 2005 · 53 citations · 20 references
Natural SciencesMathematicsComputational GeometryGeometryNumber TheoryAlgebraic GeometryConvex AnalysisConvex GeometryLattice StructuresLattice PolytopesPolyhedron Theory
The Ehrhart polynomials for the class of 0-symmetric convex lattice polytopes in Euclidean n-space ℝn are investigated. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima of such polytopes are closely related by their geometric and arithmetic means. It is also shown that the roots of the Ehrhart polynomials of lattice n-polytopes with or without interior lattice points differ essentially. Furthermore, the structure of the roots in the planar case is studied. Here it turns out that their distribution reflects basic properties of lattice polygons.
20
Lectures on the geometry of numbers
Choice Reviews Online · 1990 · 168 citations
Note dual polytopes of rational convex polytopes
Takayuki Hibi · COMBINATORICA · 1992 · 140 citations