Ehrhart polynomials of cyclic polytopes
Combinatorics
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.math/0409337,
title = {Ehrhart polynomials of cyclic polytopes},
author = {Fu Liu},
journal= {arXiv preprint arXiv:math/0409337},
year = {2007}
}
Comments
15 pages