Related papers: On positivity of Ehrhart polynomials

We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomials are bounded quadratically and Higashitani provided…

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

This paper studies rings of integral piecewise-exponential functions on rational fans. Motivated by lattice-point counting in polytopes, we introduce a special class of unimodular fans called Ehrhart fans, whose rings of integral…

We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…

In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of \emph{non}-integral convex polygons. Define a \emph{pseudo-integral…

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…

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…

Hibi showed that the polynomial in the numerator of the Ehrhart series of a reflexive polytope is palindromic. We proved that those in the numerator of the Ehrhart series of every graph polytope (defined later) of the bipartite graph is…

In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…

In this article we disprove the conjectures asserting the positivity of the coefficients of the Ehrhart polynomial of matroid polytopes by De Loera, Haws and K\"oppe (2007) and of generalized permutohedra by Castillo and Liu (2015). We…

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

The Ehrhart polynomial $\text{ehr}_P(n)$ of a lattice polytope $P$ counts the number of integer points in the $n$-th integral dilate of $P$. The $f^*$-vector of $P$, introduced by Felix Breuer in 2012, is the vector of coefficients of…

Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…

A half-integral polygon with quasi-period collapse behaves similarly to a lattice polygon in the sense that the number of lattice points in its integer dilates can be calculated as values of a polynomial, its Ehrhart polynomial. As a main…

For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is a certain integral polytope in $\mathbb{R}^m$, which can be defined as the convex hull of the vectors from $\{0,1,\ldots,n\}^m$ whose nonzero entries are…

The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with…