Generalized Ehrhart polynomials - Mathematics > CombinatoricsReport as inadecuate




Generalized Ehrhart polynomials - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhartstates that the number of lattice points in the dilations $Pn = nP$ is aquasi-polynomial in $n$. We generalize this theorem by allowing the vertices ofPn to be arbitrary rational functions in $n$. In this case we prove that thenumber of lattice points in Pn is a quasi-polynomial for $n$ sufficientlylarge. Our work was motivated by a conjecture of Ehrhart on the number ofsolutions to parametrized linear Diophantine equations whose coefficients arepolynomials in $n$, and we explain how these two problems are related.



Author: Sheng Chen, Nan Li, Steven V Sam

Source: https://arxiv.org/







Related documents