In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number of integer points the polytope contains. The theory of Ehrhart polynomials can be seen as a higher-dimensional generalization of Pick's theorem in the Euclidean plane. These polynomials are named after Eugène Ehrhart who studied them in the 1960s. Definition Informally, if is a polytope, and is the polytope formed by expanding by a factor of in each dimension, then is the number of integer lattice points in . More formally, consider a lattice in Euclidean space and a -dimensional polytope in with the property that all vertices of the polytope are points of the lattice. (A common example is and a polytope for which all vertices have integer coordinates.) For any positive integer , let be the -fold dilation of (the polytope formed by multiplying each vertex coordinate, in a basis for the lattice, by a factor of ), and let be the number of lattice points contained in the polytope . Ehrhart showed in 1962 that is a rational polynomial of degree in , i.e. there exist rational numbers such that: for all positive integers . The Ehrhart polynomial of the interior of a closed convex polytope can be computed as: where is the dimension of . This result is known as Ehrhart–Macdonald reciprocity. Examples Let be a -dimensional unit hypercube whose vertices are the integer lattice points all of whose coordinates are 0 or 1. In terms of inequalities, Then the -fold dilation of is a cube with side length , containing integer points. That is, the Ehrhart polynomial of the hypercube is . Additionally, if we evaluate at negative integers, then as we would expect from Ehrhart–Macdonald reciprocity. Many other figurate numbers can be expressed as Ehrhart polynomials. For instance, the square pyramidal numbers are given by the Ehrhart polynomials of a square pyramid with an integer unit square as its base and with height one; the Ehrhart polynomial in this case is . Ehrhart quasi-polynomials Let be a rational polytope. In other words, suppose where and (Equivalently, is the convex hull of finitely many points in ) Then define In this case, is a quasi-polynomial in . Just as with integral polytopes, Ehrhart–Macdonald reciprocity holds, that is, Examples of Ehrhart quasi-polynomials Let be a polygon with vertices (0,0), (0,2), (1,1) and (, 0).