Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of Gorenstein polytopes. In this paper, we introduce a new class of polytopes obtained from graphs and we extend their method to construct many more Gorenstein polytopes.
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.
A Gorenstein polytope of index r is a lattice polytope whose r-th dilate is a reflexive polytope. These objects are of interest in combinatorial commutative algebra and enumerative combinatorics, and play a crucial role in Batyrev's and Borisov's computation of Hodge numbers of mirror-symmetric generic Calabi-Yau complete intersections. In this paper, we report on what is known about smooth Gorenstein polytopes, i.e., Gorenstein polytopes whose normal fan is unimodular. We classify d-dimensional smooth Gorenstein polytopes with index larger than (d+3)/3. Moreover, we use a modification of Oebr…
The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two properties: they are palindromic (so the polytope is Gorenstein) and they consist of precisely three terms. This extends the classification of Gorenstein polytopes of degree two due to Batyrev and Juny. The proof relies on the recent characterization of Batyrev and Hofscheier of empty lattice simplices whose $h^*$-polynomials have precisely two terms. Putting our t…
Though much is known about ${\bf s}$-lecture hall polytopes, there are still many unanswered questions. In this paper, we show that ${\bf s}$-lecture hall polytopes satisfy the integer decomposition property (IDP) in the case of monotonic ${\bf s}$-sequences. Given restrictions on a monotonic ${\bf s}$-sequence, we discuss necessary and sufficient conditions for the Fano, reflexive and Gorenstein properties. Additionally, we give a construction for producing Gorenstein/IDP lecture hall polytopes.
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in particular, when these polytopes are Gorenstein. We also introduce the notion of domino stackings and present some results and several open questions. Our techniques use results from graph theory, polyhedral geometry, and enumerative combinatorics.
Given arbitrary integers $k$ and $d$ with $0 \leq 2k \leq d$, we construct a Gorenstein Fano polytope $\Pc \subset \RR^d$ of dimension $d$ such that (i) its Ehrhart polynomial $i(\Pc, n)$ possesses $d$ distinct roots; (ii) $i(\Pc, n)$ possesses exactly $2k$ imaginary roots; (iii) $i(\Pc, n)$ possesses exactly $d - 2k$ real roots; (iv) the real part of each of the imaginary roots is equal to $- 1 / 2$; (v) all of the real roots belong to the open interval $(-1, 0)$.
In this paper, we study nearly Gorensteinness of Ehrhart rings arising from lattice polytopes. We give necessary conditions and sufficient conditions on lattice polytopes for their Ehrhart rings to be nearly Gorenstein. Using this, we give an efficient method for constructing nearly Gorenstein polytopes. Moreover, we determine the structure of nearly Gorenstein (0, 1)-polytopes and characterise nearly Gorensteinness of edge polytopes and graphic matroids.
It is known that every integral convex polytope is unimodularly equivalent to a face of some Gorenstein Fano polytope. It is then reasonable to ask whether every normal polytope is unimodularly equivalent to a face of some normal Gorenstein Fano polytope. In the present paper, it is shown that, by giving new classes of normal Gorenstein Fano polytopes, each order polytope as well as each chain polytope of dimension $d$ is unimodularly equivalent to a facet of some normal Gorenstein Fano polytopes of dimension $d + 1$. Furthermore, investigation on combinatorial properties, especially, Ehrhart …
Let $R$ be the Ehrhart ring of the stable set polytope of a cycle graph which is not Gorenstein. We describe the non-Gorenstein locus of $\mathrm{Spec} R$. Further, we show that $R$ is almost Gorenstein. Moreover, we show that the conjecture of Hibi and Tsuchiya is true.
Inspired by ideas from algebraic geometry, Batyrev and the first named author have introduced the stringy E-function of a Gorenstein polytope. We prove that this a priori rational function is actually a polynomial, which is part of a conjecture of Batyrev and the first named author. The proof relies on a comparison result for the lattice point structure of a Gorenstein polytope P, a face F of P and the face of the dual Gorenstein polytope corresponding to F. In addition, we study joins of Gorenstein polytopes and introduce the notion of an irreducible Gorenstein polytope. We show how these con…
An integral convex polytope ${\mathcal P}$ is said to be Gorenstein if its toric ring $K[{\mathcal P}]$ is normal and Gorenstein. In this paper, Gorenstein cut polytopes of graphs are characterized explicitly. First, we prove that Gorenstein cut polytopes are compressed (i.e., all of whose reverse lexicographic triangulations are unimodular). Second, by applying Athanasiadis's theory for Gorenstein compressed polytopes, we show that a cut polytope of a graph $G$ is Gorenstein if and only if $G$ has no $K_5$-minor and $G$ is either a bipartite graph without induced cycles of length $\geq 6$ or …
In this paper, we give a criterion of the nearly Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ with connected components $G^{(1)}, \ldots, G^{(\ell)}$ is nearly Gorenstein if and only if (1) for each $i$, the Ehrhart ring of the stable set polytope of $G^{(i)}$ is Gorenstein and (2) $|ω(G^{(i)})-ω(G^{(j)})|\leq 1$ for any $i$ and $j$, where $ω(G^{(i)})$ is the clique number of $G^{(i)}$. We also show that the Segre product of Cohen-Macaulay graded rings with linear non-zerodivisor …
We give a characterizaion of Gorenstein toric Fano $n$-folds with index $n-1$, which is called Gorenstein toric Del Pezzo $n$-folds, among toric varieties. In practice, we obtain a condition for a lattice $n$-polytope to be a Gorenstein Fano polytope. In our proof, we do not use Batyrev-Juny's classification of Gorenstein Fano polytopes.
Let $P$ be a finite poset, $K$ a field, and $O(P)$ (resp. $C(P)$) the order (resp. chain) polytope of $P$. We study the non-Gorenstein locus of $E_K[O(P)]$ (resp. $E_K[C(P)]$), the Ehrhart ring of $O(P)$ (resp. $C(P)$) over $K$, which are each normal toric rings associated $P$. In particular, we show that the dimension of non-Gorenstein loci of $E_K[O(P)]$ and $E_K[C(P)]$ are the same. Further, we show that $E_K[C(P)]$ is nearly Gorenstein if and only if $P$ is the disjoint union of pure posets $P_1, \ldots, P_s$ with $|\mathrm{rank} P_i-\mathrm{rank} P_j|\leq 1$ for any $i$ and $j$.
In this paper, we give a criterion of the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ is Gorenstein if and only if (1) sizes of maximal cliques are constant (say $n$) and (2) (a) $n=1$, (b) $n=2$ and there is no odd cycle without chord and length at least 7 or (c) $n\geq 3$ and there is no odd cycle without chord and length at least 5.
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a regular unimodular triangulation satisfies McMullen's g-theorem; in particular, it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured by Stanley) for compressed polytopes. It is derived from a more general theorem on Gorenstein affine normal monoids M: one can factor K[M] (K a field) by a "long" regular sequence in such a way that the quotient is still a normal affine monoid algebra. This technique reduces all questions about the Ehrhart h-vector of P to the Ehrhart h-vector of a Gorenste…
Given a family of lattice polytopes, a common endeavor in Ehrhart theory is the classification of those polytopes in the family that are Gorenstein, or more generally level. In this article, we consider these questions for $\boldsymbol{s}$-lecture hall polytopes, which are a family of simplices arising from $\boldsymbol{s}$-lecture hall partitions. In particular, we provide concrete classifications for both of these properties purely in terms of $\boldsymbol{s}$-inversion sequences. Moreover, for a large subfamily of $\boldsymbol{s}$-lecture hall polytopes, we provide a more geometric classifi…
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…
Richard Stanley introduced the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ arising from a finite partially ordered set $P$, and showed that the Ehrhart polynomial of $\mathcal{O}(P)$ is equal to that of $\mathcal{C}(P)$. In addition, the unimodular equivalence problem of $\mathcal{O}(P)$ and $\mathcal{C}(P)$ was studied by the first author and Nan Li. In the present paper, three integral convex polytopes $Γ(\mathcal{O}(P), -\mathcal{O}(Q))$, $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ and $Γ(\mathcal{C}(P), -\mathcal{C}(Q))$, where $P$ and $Q$ are partially ordered sets wi…
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 propose a refined but natural notion of toric degenerations that respect a given embedding and show that within this framework a Gorenstein Fano variety can only be degenerated to a Gorenstein Fano toric variety if it is embedded via its anticanonical embedding. This also gives a precise criterion for reflexive polytopes to appear, which might be required for applications in mirror symmetry. For the proof of this statement we will study polytopes whose polar dual is a lattice polytope. As a byproduct we generalize a connection between the number of lattice points in a rational convex polyto…
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of them are satisfied whenever all degree and subtour elimination constraints are satisfied, {\em i.e.}\ these comb inequalities are not facet defining. The inequalities in question belong to the cases where vertices of one of the two classes occur in less than the half of the intersections of the teeth and the hand. Such side conditions are necessary, as simp…
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…
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 …
It is folklore that the cycle space of graphs of polytopes is generated by the cycles bounding the 2-faces. We provide a proof of this result that bypass homological arguments, which seem to be the most widely known proof. As a corollary, we obtain a result of Blind & Blind (1994) stating that graphs of polytopes are bipartite if and only if graphs of every 2-face are bipartite.
The Total Matching Polytope generalizes the Stable Set Polytope and the Matching Polytope. In this paper, we give the perfect formulation for Trees and we derive two new families of valid inequalities, the balanced biclique inequalities which are always facet-defining and the non-balanced lifted biclique inequalities obtained by a lifting procedure, which are facet-defining for bipartite graphs. Finally, we give a complete description for Complete Bipartite Graphs.
The purpose of this paper is to review some combinatorial ideas behind the mirror symmetry for Calabi-Yau hypersurfaces and complete intersections in Gorenstein toric Fano varieties. We suggest as a basic combinatorial object the notion of a Gorenstein polytope of index r. A natural combinatorial duality for d-dimensional Gorenstein polytopes of index r extends the well-known polar duality for reflexive polytopes (case r=1). We consider the Borisov duality between two nef-partitions as a duality between two Gorenstein polytopes P and P^* of index r together with selected special (r-1)-dimensio…
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.
Lattice polytopes which possess the integer decomposition property (IDP for short) turn up in many fields of mathematics. It is known that if the Cayley sum of lattice polytopes possesses IDP, then so does their Minkowski sum. In this paper, the Cayley sum of the order polytope of a finite poset and the stable set polytope of a finite simple graph is studied. We show that the Cayley sum of an order polytope and the stable set polytope of a perfect graph possesses a regular unimodular triangulation and IDP, and hence so does their Minkowski sum. Moreover, it turns out that, for an order polytop…
In this paper we show that the spectrum of the Q-codegree of a d-dimensional lattice polytope is finite above any positive threshold in the class of lattice polytopes with α-canonical normal fan for any fixed α>0. For α=1/r this includes lattice polytopes with Q-Gorenstein normal fan of index r. In particular, this proves Fujita's Spectrum Conjecture for polarized varieties in the case of Q-Gorenstein toric varieties of index r.
We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that every $(n-2)$-face is incident to every $n$-face (facet). We show that if $P$ admits such a flat extension for a given $k$, then the facet graph of $P$ is $(k-1)$-colorable. Conversely, we show that if the facet graph is $(k-1)$-colorable and $k-1$ is prime, then $P$ admits a flat extension for that $k$. We also show that if $P$ is facet-bipartite, then for ever…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic matching problems with a single linearized quadratic term. We provide a complete irredundant inequality description, which settles a conjecture by Klein (Ph.D. thesis, TU Dortmund, 2015). In addition, we also derive facetness and separation results for the polytopes. The completeness proof is based on a geometric relationship to a matching polytope of a non…
The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $α$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq \Re(α) \leq \frac{d}{2} -1$. In this paper, we observe the behaviors of roots of SSNN polynomials which are a wider class of the polynomials containing all the Ehrhart polynomials of Gorenstein Fano polytopes. As a result, we verify that this conjecture is true when the roots are real numbers or when $d \leq 5$.
The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this paper we show that (i) The $δ$-vector of a lattice polytope $2 {\rm FRAC}(G)$ is alternatingly increasing; (ii) The Ehrhart ring of ${\rm FRAC}(G)$ is Gorenstein; (iii) The coefficients of the numerator of the Ehrhart series of ${\rm FRAC}(G)$ are symmetric, unimodal and computed by the $δ$-vector of $2 {\rm FRAC}(G)$.
Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q. It follows that the interior polynomials of (V,E) and its transpose (E,V) agree. When G is a complete bipartite graph, our result recovers a well known hypergeometric identity due to Saalschütz. It also implies that certain extremal coefficients in the Homfly polynomial of a special alternating link can be read of…
Let X be a complex, Gorenstein, Q-factorial, toric Fano variety. We prove two conjectures on the maximal Picard number of X in terms of its dimension and its pseudo-index, and characterize the boundary cases. Equivalently, we determine the maximal number of vertices of a simplicial reflexive polytope.
The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let $\mathsf{STAB}(G)$ be the convex hull of the stable sets of $G$. It is easy to see that $n \leqslant \mathsf{xc} (\mathsf{STAB}(G)) \leqslant n+m$. We improve both of these bounds. For the upper bound, we show that $\mathsf{xc} (\mathsf{STAB}(G))$ is $O(\frac{n^2}{\log n})$, which is an improvement when $G$ has quadratically many edges. For the lower bound, we prove that …
The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to prove certain inequalities are facet inducing for the cut polytope. In this paper we introduce a lifting operation, named triangular elimination, applicable to the cut polytope of a wide range of graphs.…
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…
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $α$ of Ehrhart polynomials of polytopes of dimension $D$ satisfy $-D \le \Re(α) \le D - 1$, but also reveals some interesting phenomena for each type of polytope. Here we present two new conjectures: (1) the roots of the Ehrhart polynomial of an edge polytope for a complete multipartite graph of order $d$ lie in the circle $|z+\tfrac{d}{4}| \le \tfrac{d}{4}$ or are negative int…
Let $G=(V,E)$ be a connected simple graph, with $n$ vertices such that $S$ is its homogeneous monomial subring. We prove that if $S$ is normal and Gorenstein, then $G$ is unmixed with cover number $\lceil\frac{n}{2}\rceil$ and $G$ has a strong $\lceil\frac{n}{2}\rceil$-$τ$-reduction. Furthermore, if $n$ is even, then we show that $G$ is bipartite. Finally, if $S$ is normal and $G$ is unmixed whose cover number is $\lceil\frac{n}{2}\rceil$, we give sufficient conditions for $S$ to be Gorenstein.
A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric ideals defining edge subrings of bipartite graphs.
Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular, the authors are motivated by the study of the algebraic Kuramoto equations of unmixed form whose Newton polytopes are the symmetric edge polytopes. The interplay between the geometric structure of symmetric edge polytopes and the topological structure of the underlying graphs has been a recurring theme in recent studies. In particular, ``facet/face su…
