When are Ehrhart polynomials polynomials? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-19T23:03:18Z http://mathoverflow.net/feeds/question/27413 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/27413/when-are-ehrhart-polynomials-polynomials When are Ehrhart polynomials polynomials? Gjergji Zaimi 2010-06-08T01:04:37Z 2011-08-04T23:47:49Z <p>Given a lattice $L$ and a subset $P\subset \mathbb R^d$, we define for each positive integer $t$ $$f_P(L,t)=|(tP\cap L)|$$ the number of lattice points in $tP$. Let's say $P$ is nice if $f_P(L,t)$ is a polynomial. We know that if $P$ is a convex polytope with vertices in $L$ then $P$ is nice and $f_P(L,t)$ is its <a href="http://en.wikipedia.org/wiki/Ehrhart_polynomial" rel="nofollow">Ehrhart polynomial</a>. My question is about some converse of this statement.</p> <blockquote> <p>Are there some mild assumptions (for example convexity etc.) on $P$, under which if $f_P(L,t)$ is a polynomial with respect to at least some lattice $L$ then $P$ must be a convex polytope? Or a weaker question: Is any polynomial arising this way also the Ehrhart polynomial of some polytope?</p> </blockquote> <p>P.S. I haven't thought much about this question so I apologize if it is well-known or it has an obvious negative answer. Also feel free to retag.</p> <hr> <p>Richard Stanley suggested the following in the comments (edited to take into account a trivial family of counter-examples):</p> <blockquote> <p>Could the following be true? It seems more in line with the question. Let $P$ be a compact convex $n$-dimensional set in $\mathbb R^n$. Suppose that the Ehrhart function $f_P(t)$ is a polynomial for positive integers $t$. Then $P$ is a translation of a rational polytope.</p> </blockquote> http://mathoverflow.net/questions/27413/when-are-ehrhart-polynomials-polynomials/27419#27419 Answer by hypercube for When are Ehrhart polynomials polynomials? hypercube 2010-06-08T02:22:49Z 2010-06-08T02:22:49Z <p>If you want to dive into some Ehrhart theory then I highly recommend you pick up <em>Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra</em> by Matthias Beck and Sinai Robins.</p> <p>Here is the website for the text with a free but nonprintable version: <a href="http://math.sfsu.edu/beck/ccd.html" rel="nofollow">http://math.sfsu.edu/beck/ccd.html</a></p> http://mathoverflow.net/questions/27413/when-are-ehrhart-polynomials-polynomials/27420#27420 Answer by VA for When are Ehrhart polynomials polynomials? VA 2010-06-08T02:28:48Z 2010-06-08T02:28:48Z <p>Just to remark that for a rational polytope whose vertices are <em>not</em> integral, the function $f_P(t)$ could still be a polynomial (and not just a quasipolynomial). A large class of examples is provided by degenerations of flag varieties $G/B$. There are many degenerations, each corresponding to a representation of the longest word $w\in W$ in the Weil group as the shortest product of standard reflections. All of these correspond to rational polytopes. They all have the same Erhart function. Some of them are integral but others are not.</p> <p>For more details, see R. Chiriv`ı, LS algebras and application to Schubert varieties, Transform. Groups 5 (2000), no. 3, 245–264, or Alexeev-Brion <a href="http://arxiv.org/abs/math/0403379" rel="nofollow">Toric degenerations of spherical varieties.</a></p>