arXiv:math/0409337 [math.CO]AbstractReferencesReviewsResources
Ehrhart polynomials of cyclic polytopes
Published 2004-09-20Version 2
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial of it is equal to its volume plus the Ehrhart polynomial of its lower envelope and proved the case when the dimension d = 2. In our article, we prove the conjecture for any dimension.
Comments: 15 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1012.2545 [math.CO] (Published 2010-12-12)
Proof of Andrews' conjecture on a_4φ_3 summation
arXiv:math/0508537 [math.CO] (Published 2005-08-26)
On a conjecture of Widom
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi