Lattices generated by lattice points in skeletons of reflexive polytopes are essential in determining the fundamental group and integral cohomology of Calabi-Yau hypersurfaces. Here we prove that the lattice generated by all lattice points in a reflexive polytope is already generated by lattice points in codimension two faces. This answers a question of J. Morgan.
The reflexive dimension refldim(P) of a lattice polytope P is the minimal d so that P is the face of some d-dimensional reflexive polytope. We show that refldim(P) is finite for every P, and give bounds for refldim(kP) in terms of refldim(P) and k.
A reflexive polytope, respectively its associated Gorenstein toric Fano variety, is called pseudo-symmetric, if the polytope has a centrally symmetric pair of facets. Here we present a complete classification of pseudo-symmetric simplicial reflexive polytopes together with some applications. This generalizes a result of Ewald on pseudo-symmetric nonsingular toric Fano varieties.
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another application, we show that any reflexive polygon of arbitrary index satisfies the famous "number 12" property. This is a new, infinite class of lattice polygons possessing this property, and extends the p…
Recent work has focused on the roots z of the Ehrhart polynomial of a lattice polytope P. The case when Re(z) = -1/2 is of particular interest: these polytopes satisfy Golyshev's "canonical line hypothesis". We characterise such polytopes when dim(P) <= 7. We also consider the "half-strip condition", where all roots z satisfy -dim(P)/2 <= Re(z) <= dim(P)/2-1, and show that this holds for any reflexive polytope with dim(P) <= 5. We give an example of a 10-dimensional reflexive polytope which violates the half-strip condition, thus improving on an example by Ohsugi--Shibata in dimension 34.
It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large family of $(0,1)$-polytopes are the edge polytopes of finite simple graphs. In the present paper, it is shown that, by giving a new class of reflexive polytopes, each edge polytope is unimodularly equivalent to a facet of some reflexive polytope. Furthermore, we extend the characterization of normal edge polytopes to a characterization of normality for these…
Let $δ(\mathcal{P})$ be the $δ$-vector of a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ and $δ(\mathcal{P} ^\vee)$ the $δ$-vector of the dual polytope $\mathcal{P}^\vee \subset \mathbb{R}^d$. In general, $δ(\mathcal{P})=δ(\mathcal{P}^\vee)$ does not hold. In this paper, we give a higher-dimensional construction of reflexive polytope whose $δ$-vector equals the $δ$-vector of the dual polytope. In particular, we consider the case that the reflexive polytope and the dual polytope are unimodularly equivalent.
We classify terminal simplicial reflexive d-polytopes with 3d-1 vertices. They turn out to be smooth Fano d-polytopes. When d is even there is 1 such polytope up to isomorphism, while there are 2 when d is uneven.
The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional dilations of $P$, thus giving more information about the polytope. Nevertheless, there are some polytopes that only gain new integer points for integer values of $t$; that is, these polytopes satisfy $L_P(t) = L_P(\lfloor t \rfloor)$. We call those polytopes semi-reflexive. In this paper, we give a characterization of these polytopes in terms of their hyperpl…
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on Grönbner bases, a new class of reflexive polytopes which possess the integer decomposition property and which arise from perfect graphs will be presented. Furthermore, the Ehrhart $δ$-polynomials of these polytopes will be studied.
One may construct a large class of Calabi-Yau varieties by taking anticanonical hypersurfaces in toric varieties obtained from reflexive polytopes. If the intersection of a reflexive polytope with a hyperplane through the origin yields a lower-dimensional reflexive polytope, then the corresponding Calabi-Yau varieties are fibered by lower-dimensional Calabi-Yau varieties. A top generalizes the idea of splitting a reflexive polytope into two pieces. In contrast to the classification of reflexive polytopes, there are infinite families of equivalence classes of tops. Tops may be used to describe …
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties. In particular, we characterize unconditional reflexive polytopes in terms of perfect graphs. As a prime example, we study the signed Birkhoff polytope. Moreover, we derive constructions for Gale-dual pairs of polytopes and we explicitly describe Gröbner bases for unconditional reflexive polytopes coming from partially ordered sets
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite partially ordered sets are known. In the present paper, we will generalize this result. In fact, by virtue of the algebraic technique on Gröbner bases, new classes of reflexive polytopes with the integer decomposition property coming from the order polytopes of finite partially ordered sets and the stable set polytopes of perfect graphs will be introduced. Furt…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann ζ function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from graphs. We prove several conjectures confirming when such polynomials have zeros on a certain line in the complex plane. Our main new method is to prove a stronger property called interlacing.
An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider integrally closed reflexive simplices and discuss an operation that preserves reflexivity, integral closure, and unimodality of the $h^*$-vector, providing one explanation for why unimodality occurs in this setting. We also discuss the failure of proving unimodality in this setting using weak Lefschetz elements.
The correspondence between Gorenstein Fano toric varieties and reflexive polytopes has been generalized by Ilten and Süß to a correspondence between Gorenstein Fano complexity-one $T$-varieties and Fano divisorial polytopes. Motivated by the finiteness of reflexive polytopes in fixed dimension, we show that over a fixed base polytope, there are only finitely many Fano divisorial polytopes, up to equivalence. We classify two-dimensional Fano divisorial polytopes, recovering Huggenberger's classification of Gorenstein del Pezzo $\mathbb{K}^*$-surfaces. Furthermore, we show that any three-dimensi…
Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is normal will be constructed, where $K[\mathcal{P}]$ is the toric ring of $\mathcal{P}$.
Fano and Reflexive Polytopes from Feynman Integrals
Institut de Physique Théorique, Université Paris-Saclay, CEA, CNRS(理论物理研究所,巴黎萨克雷大学,法国原子能和替代能源委员会,法国国家科学研究中心);Department of Physics and Astronomy, Ghent University(根特大学物理与天文学系)
A lattice polytope $\mathcal{P}$ is called reflexive if its dual $\mathcal{P}^\vee$ is a lattice polytope. The property that $\mathcal{P}$ is unimodularly equivalent to $\mathcal{P}^\vee$ does not hold in general, and in fact there are few examples of such polytopes. In this note, we introduce a new reflexive simplex $Q_n$ which has this property. Additionally, we show that $δ$-polynomalial of $Q_n$ is the Eulerian polynomial and show the existence of a regular, flag, unimodular triangulation.
In this paper, we study the root distributions of Ehrhart polynomials of free sums of certain reflexive polytopes. We investigate cases where the roots of the Ehrhart polynomials of the free sums of $A_d^\vee$'s or $A_d$'s lie on the canonical line $\mathrm{Re}(z)=-\frac{1}{2}$ on the complex plane $\mathbb{C}$, where $A_d$ denotes the root polytope of type A of dimension $d$ and $A_d^\vee$ denotes its polar dual. For example, it is proved that $A_m^\vee \oplus A_n^\vee$ with $\min\{m,n\} \leq 1$ or $m+n \leq 7$, $A_2^\vee \oplus (A_1^\vee)^{\oplus n}$ and $A_3^\vee \oplus (A_1^\vee)^{\oplus n…
It is a famous open question whether every integrally closed reflexive polytope has a unimodal Ehrhart delta-vector. We generalize this question to arbitrary integrally closed lattice polytopes and we prove unimodality for the delta-vector of lattice parallelepipeds. This is the first nontrivial class of integrally closed polytopes. Moreover, we suggest a new approach to the problem for reflexive polytopes via triangulations.
We investigate Gorenstein toric Fano varieties by combinatorial methods using the notion of a reflexive polytope which appeared in connection to mirror symmetry. The paper contains generalisations of tools and previously known results for nonsingular toric Fano varieties. As applications we obtain new classification results, bounds of invariants and formulate conjectures concerning combinatorial and geometrical properties of reflexive polytopes.
We consider the skeleton of the pyramidal tours polytope. Hamiltonian tour is called pyramidal if the salesperson starts in city $1$, then visits some cities in increasing order, reaches city $n$ and returns to city $1$, visiting the remaining cities in decreasing order. The polytope $PYR(n)$ is defined as the convex hull of characteristic vectors of all pyramidal tours in the complete graph $K_{n}$. The skeleton of the polytope $PYR(n)$ is the graph whose vertex set is the vertex set of $PYR(n)$ and edge set is the set of geometric edges or one-dimensional faces of $PYR(n)$. We describe the n…
The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is the skeleton of the matching polytope of G, denoted G(M(G)). Since the number of vertices of G(M(G)) is huge, the structural properties of these graphs have been studied in particular classes. In this paper, for an arbitrary graph G, we obtain a formulae to compute the degree of a vertex of G(M(G)) and prove that the minimum degree of G(M(G)) is equal to the number of edges of G. Also, we identify…
Q-factorial Gorenstein toric Fano varieties X of dimension d with Picard number rho(X) correspond to simplicial reflexive d-polytopes with rho(X)+d vertices. Casagrande showed that any simplicial reflexive d-polytope has at most 3d vertices, if d is even, respectively, 3d-1, if d is odd. Moreover, it is known that equality for d even implies uniqueness up to unimodular equivalence. In this paper we completely classify all simplicial reflexive d-polytopes having 3d-1 vertices, corresponding to d-dimensional Q-factorial Gorenstein toric Fano varieties with Picard number 2d-1. For d even, there e…
We classify the d-dimensional simplicial, terminal, and reflexive polytopes with at least 3d-2 vertices. In particular, it turns out that these are all smooth Fano polytopes. This improves on previous results of Casagrande in 2006 and Oebro in 2008. Smooth Fano polytopes play a role in algebraic geometry and mathematical physics.
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry include a study of randomness of self-duality of reflexive polytopes and implications for expectation values of the numbers of such polytopes in higher dimensions. We also discuss enumeration problems and related algorithms and point out interesting open problems. In this context we define the notion of IP-confined polytopes. Our new results include the list of…
We give a short and simple proof of a recent result of Dobbins that any point in an $nd$-polytope is the barycenter of $n$ points in the $d$-skeleton. This new proof builds on the constraint method that we recently introduced to prove Tverberg-type results.
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for vertex adjacency in the 1-skeleton of the traveling salesperson polytope can be formulated as the Hamiltonian decomposition problem in a 4-regular multigraph. We introduce a heuristic general variable neighborhood search algorithm for this problem based on finding a vertex-disjoint cycle cover of the multigraph through reduction to perfect matching and several cycle merging operations. The algorithm has a one-sided error: the answer "not adjacent" is…
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 condition for a polytope to be reflexive, and derive formulae for the f-vector of a smooth polytope in dimensions 3, 4, and 5. We also give applications to reflexive order polytopes, and to the Birkhoff polytope.
We generalize the well-known "12" and "24" Theorems for reflexive polytopes of dimension 2 and 3 to any smooth reflexive polytope. Our methods apply to a wider category of objects, here called reflexive GKM graphs, that are associated with certain monotone symplectic manifolds which do not necessarily admit a toric action. As an application, we provide bounds on the Betti numbers for certain monotone Hamiltonian spaces which depend on the minimal Chern number of the manifold.
Given a reductive group $G$ and a parabolic subgroup $P\subset G$, with maximaltorus $T$, we consider (following Dabrowski's work) the closure $X$ of a generic $T$-orbit in $G/P$, and determine in combinatorial termswhen the toric variety $X$ is $\mathbb{Q}$-Gorenstein Fano, extending in this way the classification of smooth Fano generic closures given by Voskresenski\uı and Klyachko. As an application, we apply the well known correspondence between Gorenstein Fano toric varieties and reflexive polytopes in order to exhibit which reflexive polytopes correspond to generic closures -- this list …
Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of when a reflexive weighted projective space simplex has the integer decomposition property. We provide a complete classification of reflexive weighted projective space simplices having the integer decomposition property for the case when there are at most three distinct non-unit weights, and conjecture a general classification for an arbitrary number of distin…
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$. We show that (1) the face lattice of any $d$-polytope with at most two nonsimple vertices is determined by its $1$-skeleton; (2) the face lattice of any $d$-polytope with at most $d-2$ nonsimple vertices is determined by its $2$-skeleton; and (3) for any $d>3$ there are two $d$-polytopes with $d-1$ nonsimple vertices, isomorphic $(d-3)$-skeleta and nonisomo…
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…
Pyramidal tours with step-backs are Hamiltonian tours of a special kind: the salesperson starts in city 1, then visits some cities in ascending order, reaches city $n$, and returns to city 1 visiting the remaining cities in descending order. However, in the ascending and descending direction, the order of neighboring cities can be inverted (a step-back). It is known that on pyramidal tours with step-backs the traveling salesperson problem can be solved by dynamic programming in polynomial time. We define the polytope of pyramidal tours with step-backs $\operatorname{PSB}(n)$ as the convex hull…
The Birkhoff polytope, defined to be the convex hull of $n\times n$ permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to have many desirable properties, such as the Gorenstein property and existence of regular, unimodular triangulations. In this paper, we study analogues of the Birkhoff polytope for finite irreducible Coxeter groups of other types. We focus on a type-$B$ Birkhoff polytope $\mathcal{BB}(n)$ arising from signed permutation matrices and prove that it and its dual polytope are reflexive, and hence Gorenstein, and also pos…
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a previously disproved conjecture which stated that any Gorenstein lattice polytope has a unimodal $h^\ast$-polynomial. The first counterexamples to unimodality for Gorenstein lattice polytopes were given in even dimensions greater than five by Musta{ţ}{ǎ} and Payne, and this was extended to all dimensions greater than five by Payne. While there exist numerous e…
We discuss the problem on the connectedness of various webs of lattice polytopes by introducing a geometric point of view from the toric Mori theory. To this end, we provide a combinatorial description of toric Sarkisov links in terms of certain sets of lattice points, which we call primitive generating sets. In two dimensions, the description is further translated into the language of lattice polygons. As an application, we prove in two ways (constructive and non-constructive) that reflexive or terminal polygons form a single connected web via inclusion relations even without taking modulo un…
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the $h^\ast$-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomials. In both cases, we prove tha…
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 determine the diameter of the 1-skeleton and the combinatorial automorphism group of any Gelfand-Tsetlin polytope GT$_λ$ associated to an integer partition $λ.$
There exist exactly 166 4-dimensional reflexive polytopes such that the corresponding 4-dimensional Gorenstein toric Fano varieties have at worst terminal singularities in codimension 3 and their anticanonical divisor is divisible by 2. For every such a polytope, one naturally obtains a family of Fano hypersurfaces X with at worst conifold singularities. A generic 3-dimensional Fano hypersurface X can be interpreted as a flat conifold degeneration of some smooth Fano 3-folds Y whose classification up to deformation was obtained by Iskovskikh, Mori and Mukai. In this case, both Fano varieties X…
A $d$-dimensional lattice polytope $P$ is Gorenstein if it has a multiple $r P$ that is a reflexive polytope up to translation by a lattice vector. The difference $d+1-r$ is called the degree of $P$. We show that a Gorenstein polytope is a lattice pyramid if its dimension is at least three times its degree. This was previously conjectured by Batyrev and Juny. We also present a refined conjecture and prove it for IDP Gorenstein polytopes.
Very recently, Galashin, Postnikov, and Williams introduced the notion of higher secondary polytopes, generalizing the secondary polytope of Gelfand, Kapranov, and Zelevinsky. Given an $n$-point configuration $\mathcal{A}$ in $\mathbb{R}^{d-1}$, they define a family of convex $(n-d)$-dimensional polytopes $\widehatΣ_{1}, \ldots, \widehatΣ_{n-d}$. The $1$-skeletons of this family of polytopes are the flip graphs of certain combinatorial configurations which generalize triangulations of $\text{conv} \mathcal{A}$. We restrict our attention to $d=2$. First, we relate the $1$-skeleton of the Minkow…
We present a constructive proof, that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope β^k into closed surfaces of genus \leq 1, each with a transitive automorphism group given by the vertex transitive Z_{2k}-action on β^k. Furthermore we show, that for each k \equiv 1,5(6) the 2-skeleton of the (k-1)-simplex is a union of highly symmetric tori and Möbius strips.
Reflexive polytopes have been studied from viewpoints of combinatorics, commutative algebra and algebraic geometry. A nef-partition of a reflexive polytope $\mathcal{P}$ is a decomposition $\mathcal{P}=\mathcal{P}_1+\cdots+\mathcal{P}_r$ such that each $\mathcal{P}_i$ is a lattice polytope containing the origin. Batyrev and van Straten gave a combinatorial method for explicit constructions of mirror pairs of Calabi-Yau complete intersections obtained from nef-partitions. In the present paper, by means of Gröbner basis techniques, we give a large family of nef-partitions arising from unimodular…
Given a $d$-dimensional convex polytope $P$ and nonnegative integer $k$ not exceeding $d-1$, let $G_k (P)$ denote the simple graph on the node set of $k$-dimensional faces of $P$ in which two such faces are adjacent if there exists a $(k+1)$-dimensional face of $P$ which contains them both. The graph $G_k (P)$ is isomorphic to the dual graph of the $(d-k)$-dimensional skeleton of the normal fan of $P$. For fixed values of $k$ and $d$, the largest integer $m$ such that $G_k (P)$ is $m$-vertex-connected for all $d$-dimensional polytopes $P$ is determined. This result generalizes Balinski's theor…