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]
Computing the Continuous Discretely by Matthias Beck and Sinai Robins. Theorems 3.8 and 3.23; §3.5, leading coefficient
New to topics? Read the docs here!