Experimental Study of the Ehrhart Interpolation Polytope
- 304 Downloads
In this paper we define a family of polytopes called Ehrhart Interpolation Polytopes with respect to a given polytope and a parameter corresponding to the dilation of the polytope. We experimentally study the behavior of the number of lattice points in each member of the family, looking for a member with a single lattice point. That single lattice point is the h* vector of the given polytope. Our study is motivated by efficient algorithms for lattice point enumeration.
The second author acknowledges support from the project BAP 2016-A-27 of Gebze Technical University.
- 1.Beck, M., De Loera, J.A., Develin, M., Pfeifle, J., Stanley, R.P.: Coefficients and Roots of Ehrhart Polynomials. ArXiv Mathematics e-prints, February 2004Google Scholar
- 3.Emiris, I.Z., Fisikopoulos, V.: Efficient random-walk methods for approximating polytope volume. In: 30th Annual Symposium on Computational Geometry, Kyoto, Japan, p. 318 (2014)Google Scholar
- 4.Köppe, M.: Personal communicationGoogle Scholar
- 5.The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.0.0) (2017). http://www.sagemath.org
- 6.Stanley, R.P.: Decompositions of rational convex polytopes. In: Srivastava, J., (ed.) Combinatorial Mathematics, Optimal Designs and Their Applications. Ann. Discrete Math. 6, 333–342. Elsevier (1980)Google Scholar