Classical Ehrhart theory measures the discrete capacity of a convex rational (or integral) polytope by counting the number of lattice points in the -th dilate of . In this paper, we extend this paradigm by replacing a lattice point with a geometric object of dimension at most . We show that the counting function of such valid translations of into inherits eventual quasi-polynomiality (or eventual polynomiality) with leading term , where . This result is naturally derived by induction on the dimension, based on the classical quasi-polynomiality (or polynomiality) of Ehrhart functions. Similarly, replacing with its relative interior defines , which is also shown to be an eventual quasi-polynomial (or eventual polynomial). Furthermore, we prove several formulas for relative Ehrhart functions under the condition that and for some integers , , and polytopes and with such that is inscribed in . In particular, we prove that under this condition, holds for some integer if and only if via the classical Ehrhart–Macdonald reciprocity law. We also prove that under the same condition, holds for some integer if and only if and .

生成讲解博客的中文版本

生成AI智能校验的中文版本