<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06026273</id>
  <dt>j</dt>
  <an>06026273</an>
  <augroup>
    <au>Chen, Sheng</au>
    <au>Li, Nan</au>
    <au>Sam, Steven V.</au>
  </augroup>
  <ti>Generalized Ehrhart polynomials.</ti>
  <so>Trans. Am. Math. Soc. 364, No. 1, 551-569 (2012).</so>
  <py>2012</py>
  <pu>American Mathematical Society, Providence, RI</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Ehrhart polynomials</ut>
    <ut>integer solutions of Diophantine equations</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1090/S0002-9947-2011-05494-2</li>
  </ligroup>
  <abgroup>
    <ab>Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $nP$ is a quasi-polynomial in $n$. The authors generalize this theorem by allowing the vertices of $nP$ to be arbitrary rational functions in $n$. They show that the number of lattice points in $nP$ is a quasi-polynomial for sufficiently large $n$. Further the authors show that this problem is closely related to Ehrhart's conjecture on the solution-counting problem for a parametrized linear Diophantine equation with coefficients polynomial in $n$.</ab>
    <rv>Oleg Karpenkov (Graz)</rv>
  </abgroup>
</item>