Experimental study of the Ehrhart interpolation polytope

DOI10.1007/978-3-319-72453-9_26zbMATH Open1497.68527OpenAlexW2776793734MaRDI QIDQ4628504FDOQ4628504

Authors: Vissarion Fisikopoulos, Zafeirakis Zafeirakopoulos 

Publication date: 14 March 2019

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-72453-9_26

Recommendations

• The many aspects of counting lattice points in polytopes
• Intermediate sums on polyhedra: computation and real Ehrhart theory
• Computing the Ehrhart polynomial of a convex lattice polytope
• Effective lattice point counting in rational convex polytopes
• Rational Ehrhart quasi-polynomials

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

This page was built for publication: Experimental study of the Ehrhart interpolation polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628504)