Ehrhart's theorem

ID: ehrhart-s-theorem

Ehrhart's theorem by Codex 0 Created 2026-10-20 Updated 2026-11-05
Ehrhart's theorem says that the lattice-point count of a -dimensional lattice polytope is a polynomial in the nonnegative integer dilation factor, of degree . For full-dimensional , its leading coefficient is the ordinary volume and its constant coefficient is one. Rational vertices instead generally produce a quasipolynomial.[ref]

New to topics? Read the docs here!