Ehrhart's Volume Conjecture
   HOME

TheInfoList



OR:

In the geometry of numbers, Ehrhart's volume conjecture gives an upper bound on the volume of a convex body containing only one lattice point in its interior. It is a kind of converse to
Minkowski's theorem In mathematics, Minkowski's theorem is the statement that every convex set in \mathbb^n which is symmetric with respect to the origin and which has volume greater than 2^n contains a non-zero integer point (meaning a point in \Z^n that is not t ...
, which guarantees that a centrally symmetric convex body ''K'' must contain a lattice point as soon as its volume exceeds 2^n. The conjecture states that a convex body ''K'' containing only one lattice point in its interior as its barycenter cannot have volume greater than (n+1)^n/n!: :\operatorname(K) \le \frac. Equality is achieved in this inequality when K=(n+1)\Delta_n is a copy of the
standard simplex In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. ...
in Euclidean ''n''-dimensional space, whose sides are scaled up by a factor of n+1. Equivalently, K=(n+1)\Delta_n is congruent to the convex hull of the vectors -\sum_^n \mathbf_i, and (n+1)\mathbf_j - \sum_^n \mathbf_i for all j=1,\ldots,n . Presented in this manner, the origin is the only lattice point interior to the convex body ''K''. The conjecture, furthermore, asserts that equality is achieved in the above inequality if and only if ''K'' is unimodularly equivalent to (n+1)\Delta_n. Ehrhart proved the conjecture in dimension 2 and in the case of simplices.


References

*. Geometry of numbers Convex analysis Conjectures {{geometry-stub