.png){kind=icon}
.png){kind=icon}
Return
Weighted Ehrhart functions
.png){kind=icon}
OA
AI
DOI：10.1007/s40590-025-00844-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Lattice polytopes
Weights on lattice points
Eulerian numbers
Ehrhart functions
Ehrhart rings
Polynomial interpolation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
B
IF:
0.8
Papers:
99
Citations:
0