Ehrhart's volume conjecture

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, which guarantees that a centrally symmetric convex body K {\displaystyle K} must contain a lattice point as soon as its volume exceeds 2 n {\displaystyle 2^{n}} .

Source: Wikipedia — Ehrhart's volume conjecture (CC BY-SA 4.0)

Ehrhart's volume conjecture

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, which guarantees that a centrally symmetric convex body K {\displaystyle K} must contain a lattice point as soon as its volume exceeds 2 n {\displaystyle 2^{n}} .

This neuron ends here.

Source: Wikipedia "Ehrhart's volume conjecture" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy