Mathematics – Combinatorics
Scientific paper
2010-02-19
Trans. Amer. Math. Soc. 364 (2012), 551-569
Mathematics
Combinatorics
18 pages, no figures; v2: Sections 4 and 5 added, proofs and exposition have been expanded and clarified
Scientific paper
10.1090/S0002-9947-2011-05494-2
Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in P(n) is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parametrized linear Diophantine equations whose coefficients are polynomials in $n$, and we explain how these two problems are related.
Chen Sheng
Li Nan
Sam Steven V.
No associations
LandOfFree
Generalized Ehrhart polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Generalized Ehrhart polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Ehrhart polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-363183