Ehrhart polynomial ($L_P(n)=\#(nP\cap {\mathbb{Z}}^d)$)

For a lattice polytope $P$, its Ehrhart polynomial counts integer points in dilates: $L_P(n)=\#(nP\cap {\mathbb{Z}}^d)$ for nonnegative integers $n$. Ehrhart's theorem makes this counting function a polynomial. For the unit square, $L_P(n)=(n+1{)}^2$: there are $n+1$ choices for each coordinate. This turns a geometric counting problem into algebra.^[ref]

For a $d$-dimensional lattice polytope $P$ and positive integer $n$, Ehrhart reciprocity stateswith relative interior when needed. Negative input means polynomial evaluation, not a negative dilation count. For the unit square, $(1-n{)}^2=(n-1{)}^2$ counts the interior grid points of its $n$th dilation.^[ref]

Ehrhart's theorem says that the lattice-point count $L_P(n)$ of a $d$-dimensional lattice polytope is a polynomial in the nonnegative integer dilation factor, of degree $d$. For full-dimensional $P\subset {\mathbb{R}}^d$, its leading coefficient is the ordinary volume and its constant coefficient is one. Rational vertices instead generally produce a quasipolynomial.^[ref]