Related papers: Three-dimensional lattice polytopes with two inter…
We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…
We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…
The Kodaira dimension of a nondegenerate toric hypersurface can be computed from the dimension of the Fine interior of its Newton polytope according to recent work of Victor Batyrev, where the Fine interior of the Newton polytope is the…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…
We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…
We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…
We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…