Abstract
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.
Cite
CITATION STYLE
Fisikopoulos, V., & Zafeirakopoulos, Z. (2017). Experimental study of the Ehrhart interpolation polytope. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10693 LNCS, pp. 320–324). Springer Verlag. https://doi.org/10.1007/978-3-319-72453-9_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
