Abstract
We prove that computation of any fixed number of highest coefficients of the Ehrhart polynomial of an integral polytope can be reduced in polynomial time to computation of the volumes of faces.
Article PDF
Similar content being viewed by others
References
A. Barvinok, Computing the Ehrhart polynomial of a convex lattice polytope, Preprint, TRITA/MAT-92-0036, Royal Institute of Technology, Stockholm, 1992.
A. I. Barvinok, A polynomial-time algorithm for counting integral points in polyhedra when the dimension is fixed,Proceedings of 34th Symposium on the Foundations of Computer Science (FOCS ’93), IEEE Computer Society Press, New York, 1993, pp. 566–572.
W. Cook, M. Hartmann, R. Kannan, and C. McDiarmid, On integer points in polyhedra,Combinatorica 12 (1992), 27–37.
M. Dyer and A. M. Frieze, On the complexity of computing the volume of a polyhedron,SIAM J. Comput. 17(5) (1988), 967–974.
W. Fulton,Introduction to Toric Varieties, Annals of Mathematics Studies, Vol. 131, Princeton University Press, Princeton, NJ, 1993.
M. Grötschel, L. Lovasz, and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, Vol. 2, Springer-Verlag, Berlin, 1988.
R. Kannan, Minkowski’s convex body theorem and integer programming.Math. Oper. Res.,12 (1987), 415–440.
J. Lawrence, Polytope volume computation,Math. Comp.,57(195) (1991), 259–271.
I. G. Macdonald, Polynomials associated with finite cell complexes.J. London Math. Soc. (2),4 (1971), 181–192.
R. Morelli, Pick’s theorem and the Todd class of a toric variety.Adv. in Math.,100(2) (1993), 183–231.
J. E. Pommersheim, Toric varieties, lattice points and Dedekind sums.Math. Ann.,295 (1993), 1–24.
R. P. Stanley,Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks/Cole, Monterey, CA, 1986.
Author information
Authors and Affiliations
Additional information
This research was supported by the United States Army Research Office through the Army Center of Excellence for Symbolic Methods in Algorithmic Mathematics (ACSyAM), Mathematical Sciences Institute of Cornell University, Contract DAAL03-91-C-0027.
Rights and permissions
About this article
Cite this article
Barvinok, A.I. Computing the Ehrhart polynomial of a convex lattice polytope. Discrete Comput Geom 12, 35–48 (1994). https://doi.org/10.1007/BF02574364
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574364