Weighted Ehrhart functions
Abstract
Abstract We give an algorithm for computing weighted Ehrhart functions of lattice polytopes with polynomial weights on its lattice points using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers, and apply integer programming to study the algebraic properties of the Ehrhart ring of the d -th unit cube. We then present some applications to weighted Ehrhart functions and enumeration problems using linear functions and homogeneous polynomials as weights.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Polynomial and algebraic computation
Advanced Mathematical Identities
Publication details
- Journal / source
- Boletín de la Sociedad Matemática Mexicana
- Volume
- 32
- Issue
- 1
- Publication date
- 3 January 2026
- Language
- EN