Ehrhart polynomials of polytopes and spectrum at infinity of Laurent polynomials
classification
🧮 math.CO
math.AG
keywords
ehrhartinfinitylaurentpolynomialpolynomialspolytopesspectrumalgorithm
read the original abstract
Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute the Ehrhart polynomial of a simplex containing the origin as an interior point.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.