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 points. This was conjectured by Treutlein. As an immediate corollary, we get a short proof of a recent result of Averkov, Wagner and Weismantel, namely the finiteness of the number of maximal lattice polytopes without interior lattice points. Moreover, we show that in dimension four and higher some of these finitely many polytopes are not maximal as convex bodies without interior lattice points.
The Fine interior $Δ^{\text{FI}}$ of a $d$-dimensional lattice polytope $Δ$ is a rational subpolytope of $Δ$ which is important for constructing minimal birational models of non-degenerate hypersurfaces defined by Laurent polynomials with Newton polytope $Δ$. This paper presents some computational results on the Fine interior of all $674,\!688$ three-dimensional canonical Fano polytopes.
Multiples of lattice polytopes without interior lattice points
设$Δ$是$n$维格多面体.使$k Δ$不含$1 \leq k \leq n - i$内部格点的最小非负整数$i$称为$Δ$的度.我们考虑固定次数$d$和任意维数$n$的格多面体。我们的主要结果是对$d=1$度的$n$维格多面体的完全分类.这是Arkinstall，Khovanskii，Koelman和Schicho对无内格点的格多边形$(n=2)$分类的推广。我们的分类表明，一次格多面体的次多面体总是一个简单的多面体。
We show that h*-vectors of alcoved polytopes P in R^n (of Lie type A) are unimodal if they contain interior lattice points and their facets have lattice distance 1 to the set of interior lattice points. The maximal possible such distance for general alcoved polytopes is shown to be dim(P)-1. A secondary purpose of the paper is to serve as a guide to previous work surrounding unimodality of h*-vectors of alcoved polytopes and related questions.
In this paper, we introduce polytopes ${\mathcal B}_G$ arising from root systems $B_n$ and finite graphs $G$, and study their combinatorial and algebraic properties. In particular, it is shown that ${\mathcal B}_G$ is reflexive if and only if $G$ is bipartite. Moreover, in the case, ${\mathcal B}_G$ has a regular unimodular triangulation. This implies that the $h^*$-polynomial of ${\mathcal B}_G$ is palindromic and unimodal when $G$ is bipartite. Furthermore, we discuss stronger properties, namely the $γ$-positivity and the real-rootedness of the $h^*$-polynomials. In fact, if $G$ is bipartite…
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.
Originally introduced by Fine and Reid in the study of plurigenera of toric hypersurfaces, the Fine interior of a lattice polytope got recently into the focus of research. It is has been used for constructing canonical models in the sense of Mori Theory [arXiv:2008.05814]. Based on the Fine interior, we propose here a modification of the original adjoint polytopes as defined in [arXiv:1105.2415], by defining the Fine adjoint polytope $P^{F(s)}$ of $P$ as consisting of the points in $P$ that have lattice distance at least $s$ to all valid inequalities for $P$. We obtain a Fine Polyhedral Adjunc…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower bound theorem of Ehrhart polynomials that, when $c > 0$, the volume of $\mathcal{P}$ is bigger than or equal to $(dc + (d-1)b - d^2 + 2)/d!$. In the present paper, via triangulations, a short and elementary proof of the minimal volume formula is given.
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-free polytopes: the family $\mathcal{L}^d$ of integral lattice-free polytopes in $\mathbb{R}^d$ that are not properly contained in another integral lattice-free polytope and its subfamily $\mathcal{M}^d$ consisting of integral lattice-free polytopes in $\mathbb{R}^d$ which are not properly contained in another lattice-free set. It is known that $\mathcal{M}^d = \mathcal{L}^d$ holds for $d \le 3$ and, for e…
Let $Δ$ be a $3$-dimensional lattice polytope containing exactly one interior lattice point. We give a simple combinatorial formula for computing the stringy $E$-function of the $3$-dimensional canonical toric Fano variety $X_Δ$ associated with the polytope $Δ$. Using the stringy Libgober-Wood identity and our formula, we generalize the well-known combinatorial identity $\sum_{θ\preceq Δ\atop \dim (θ) =1} v(θ) \cdot v(θ^*) = 24$ holding in the case of $3$-dimensional reflexive polytopes $Δ$.
We investigate the combinatorics of quivers that arise from triangulations of even-dimensional cyclic polytopes. Work of Oppermann and Thomas pinpoints such quivers as the prototypes for higher-dimensional cluster theory. We first show that a $2d$-dimensional triangulation has no interior $(d + 1)$-simplices if and only if its quiver is a cut quiver of type $A$, in the sense of Iyama and Oppermann. This is a higher-dimensional generalisation of the fact that triangulations of polygons with no interior triangles correspond to orientations of an $A_{n}$ Dynkin diagram. An application of this fir…
It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined $n$-tuples of mixed degree at most one to be exactly those for which this lower bound is attained with equality, and posed the problem of a classification of such tuples. We give a finiteness result regarding this problem in general dimension $n \geq 4$, showing that all but finitely many $n$-tuples of mixed degree at most one admit a common lattice projection …
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 enumeration of such equivalence classes for arbitrary constants d and K. The algorithm, which gives another proof of the finiteness result, is implemented for small values of K, up to dimension six. The resulting database contains and extends several existing ones, and has been used to correct mistakes in other classifications. When specialized to three-dimensional s…
