Nef-partitions arising from unimodular configurations
Hidefumi Ohsugi, Akiyoshi Tsuchiya

TL;DR
This paper introduces a new method for constructing nef-partitions of reflexive polytopes using Gröbner basis techniques, expanding the class of known nef-partitions from unimodular configurations.
Contribution
It provides a large family of nef-partitions derived from unimodular configurations through Gröbner basis methods, enhancing combinatorial and algebraic tools for mirror symmetry.
Findings
Constructed numerous nef-partitions from unimodular configurations.
Applied Gröbner basis techniques to combinatorial geometry.
Extended the class of nef-partitions available for mirror symmetry studies.
Abstract
Reflexive polytopes have been studied from viewpoints of combinatorics, commutative algebra and algebraic geometry. A nef-partition of a reflexive polytope is a decomposition such that each 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\"{o}bner basis techniques, we give a large family of nef-partitions arising from unimodular configurations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Nef-partitions arising from unimodular configurations
Hidefumi Ohsugi and Akiyoshi Tsuchiya
Hidefumi Ohsugi, Department of Mathematical Sciences, School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo 669-1337, Japan
Akiyoshi Tsuchiya, Graduate school of Mathematical Sciences, University of Tokyo, Komaba, Meguro-ku, Tokyo 153-8914, Japan
Abstract.
Reflexive polytopes have been studied from viewpoints of combinatorics, commutative algebra and algebraic geometry. A nef-partition of a reflexive polytope is a decomposition such that each 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 configurations.
Key words and phrases:
reflexive polytope, Gorenstein polytope, nef-partition, integer decomposition property, Gröbner basis
2010 Mathematics Subject Classification:
05A15, 05C31, 13P10, 52B12, 52B20
Introduction
A lattice polytope is a convex polytope all of whose vertices have integer coordinates. A lattice polytope of dimension is called reflexive if the origin of belongs to the interior of and if the dual polytope
[TABLE]
is again a lattice polytope. Here is the canonical inner product of . It is known that reflexive polytopes correspond to Gorenstein toric Fano varieties, and they are related to mirror symmetry (see, e.g., [1, 7]). Combinatorial aspects of mirror symmetry motivate the following definition: a nef-partition of length is a decomposition of a -dimensional reflexive polytope into a Minkowski sum of lattice polytopes such that each . Nef-partitions give many explicit constructions of mirrors of Calabi-Yau complete intersections ([3, 4, 5]).
In the present paper, making use of algebraic techniques involving Gröbner bases, we give a large family of nef-partitions arising from unimodular configurations. Given positive integers and , let denote the set of all integer matrices. A configuration of is a matrix , for which there exists an affine hyperplane not passing such that each column vector of lies . An integer matrix of rank is called unimodular if all nonzero maximal minors of have the same absolute value. Unimodular matrices are important in polyhedral combinatorics and combinatorial optimization [18]. Given an integer matrix , let . A famous example of a unimodular matrix is the incidence matrix of a bipartite graph (by deleting redundant rows) and is called the edge polytope of (see Section 3).
In order to give a family of nef-partitions, we consider whether the Cayley sum of given lattice polytopes is Gorenstein. A lattice polytope is called Gorenstein of index if is unimodularly equivalent to a reflexive polytope. In particular, a reflexive polytope is Gorenstein of index . Gorenstein polytopes are of interest in combinatorial commutative algebra, mirror symmetry, and tropical geometry (we refer to [2, 3, 14]). Given lattice polytopes , the Cayley sum of is the lattice polytope
[TABLE]
where are the standard basis of . Then it is known that is Gorenstein of index if (and only if) is Gorenstein of index ([3, Theorem 2.6]). On the other hand, our interest is in whether possesses a regular unimodular triangulation. A unimodular simplex is a lattice simplex which is unimodularly equivalent to the standard simplex , the convex hull of together with . Equivalently, a full-dimensional lattice simplex in is unimodular if and only if it has the minimal possible Euclidean volume, . A triangulation of a lattice polytope is called unimodular if every maximal simplex is unimodular. A full-dimensional lattice polytope is called spanning if it holds . In general, we say that a lattice polytope is spanning if it is unimodularly equivalent to a full-dimensional spanning polytope. Sturmfels gave a one-to-one correspondence between a regular triangulation of a lattice polytope and the radical of an initial ideal of its toric ideal ([20, Section 8]). In particular, for a spanning polytope, its regular triangulation is unimodular if and only if the associated initial ideal is squarefree. Moreover, it follows that if possesses a regular unimodular triangulation for spanning polytopes of dimension , then so does ([13, Theorem 2.2]). In particular, from [21, Theorem 0.4] one has
[TABLE]
In [15], Oda asked when the equation (1) holds. Recently, this question and the following conjecture are among the current trends of the research on lattice polytopes.
Oda Conjecture. Every smooth polytope has the integer decomposition property.
For a lattice polytope , we let . The main results of the present paper are the following two theorems.
Theorem 0.1**.**
Let be a unimodular configuration. Assume that and is spanning. Then
- (1)
* is Gorenstein of index with a regular unimodular triangulation*;** 2. (2)
* is reflexive with a regular unimodular triangulation. In particular, is a nef-partition, where is an arbitrary lattice point in ;* 3. (3)
One has .
Theorem 0.2**.**
Let be a unimodular configuration and set . Assume that and is spanning. Then
- (1)
* is Gorenstein of index with a regular unimodular triangulation*;** 2. (2)
* is reflexive with a regular unimodular triangulation. In particular, is a nef-partition*;** 3. (3)
One has .
Remark 0.3**.**
In general, for a lattice polytope , if is reflexive, then is a nef-partition, where is an arbitrary lattice point in .
In Section 3, we will apply these theorems to unimodular configurations arising from finite simple graphs. In fact, we will show that for any finite simple graph all pairs of whose odd cycles have a common vertex, is a nef-partition, where is an arbitrary lattice point in (Theorem 3.3). Note that for such a graph, the edge polytope is unimodular, i.e., all triangulations are unimodular. Moreover, we will show that for any finite bipartite graphs , is a nef-partition (Theorem 3.6).
The present paper is organized as follows: In Section 1, we will investigate three types of toric ideals arising from unimodular configurations. In particular, they possess squarefree initial ideals with respect to some reverse lexicographic orders (Theorems 1.2, 1.3 and 1.4). In Section 2, we compare -polynomials with -polynomials for the ideals and initial ideals considered in Theorems 1.2, 1.3 and 1.4, thus proving Theorems 0.1 and 0.2. Finally, in Section 3, we apply these theorems to unimodular configurations arising from finite simple graphs.
1. Reverse lexicographic Gröbner bases of unimodular configurations
Let be a configuration. From now on, we always assume that has no repeated columns. Let be a Laurent polynomial ring over a field . Given an integer vector , let be a Laurent monomial in . The toric ring of is a semigroup ring generated by over . Let be a polynomial ring over with each . Then the toric ideal of is the kernel of a surjective ring homomorphism defined by for each . It is known that is generated by homogeneous binomials (of degree ) if . In addition, any reduced Gröbner basis of consists of homogeneous binomials. See [11, Section 3] for the introduction to toric rings and ideals. For a lattice polytope with , we define a configuration
[TABLE]
Then the toric ring of is and the toric ideal of is .
Given an integer matrix , let be a configuration
[TABLE]
The configuration is called the centrally symmetric configuration of . The toric ideal of a configuration is the kernel of a ring homomorphism
[TABLE]
defined by , for each , and . The following proposition is given in [17, Theorems 2.7, 2.15 and Corollary 2.8].
Proposition 1.1**.**
Let be a unimodular matrix. Then we have the following:**
- (a)
The initial ideal of is squarefree with respect to a reverse lexicographic order such that the smallest variable is ;
- (b)
The toric ring is normal and Gorenstein. In particular the -polynomial of is a palindromic polynomial of degree , i.e., .
In [17], Proposition 1.1 (a) is shown by studying the corresponding triangulation of , and Proposition 1.1 (b) is shown by using Proposition 1.1 (a). We now study the reverse lexicographic Gröbner bases of in detail when is a unimodular configuration.
Theorem 1.2**.**
Let be a unimodular configuration. Let be the reverse lexicographic order induced by the ordering of variables . Then the reduced Gröbner basis of with respect to is of the form
[TABLE]
where , , , and any monomial of is squarefree.
Proof.
Let be the reduced Gröbner basis and let . It is easy to see that is a subset of . Let
[TABLE]
be a binomial in with . Since belongs to the reduced Gröbner basis, (i) must be irreducible, (ii) belongs to the minimal set of monomial generators of , and (iii) . By Proposition 1.1 (a), is squarefree, that is, . Moreover, if , then is divisible by the initial monomial of , a contradiction to the assumption that is the reduced Gröbner basis. Hence for each . Since belongs to , we have
[TABLE]
and . Moreover since is a configuration, there exists a vector such that the inner product for all . Taking the inner product of equation (3) with , we have
[TABLE]
Thus , and hence is even.
Suppose that . Since is even, we have . Let . If , then belongs to . Since , we have . Thus divides , a contradiction. If , then belongs to . Since , we have . Thus divides , a contradiction. Therefore , and hence .
Since is irreducible and is a reverse lexicographic order, does not appear in . Suppose that appears in . Since is a reverse lexicographic order, is divisible by . Then belongs to . The initial monomial of is that is not squarefree. Since the initial ideal is squarefree, belongs to the initial ideal. This contradicts that belongs to the reduced Gröbner basis. Thus .
Finally, suppose that is not squarefree. Let . By equation (3), belongs to the toric ideal and has a monomial that is not squarefree. An irreducible binomial of is called a circuit of if there is no binomial such that . Here is the set of all variables appearing in . By [11, Lemma 4.32] there exists a circuit such that
[TABLE]
Since is unimodular, by [11, Theorem 4.35], both and are squarefree. Hence we have . Note that belongs to for some with . If , then belongs to the initial ideal, and hence so does . This contradicts that belongs to the reduced Gröbner basis. If , then is divisible by and hence . Then is the initial monomial of a binomial , a contradiction. If , then and either or is divisible by , a contradiction. Thus it follows that is squarefree. ∎
Let be a unimodular configuration. Assume that . The toric ideal of is the kernel of a ring homomorphism
[TABLE]
defined by , for each .
Theorem 1.3**.**
Work with the same notation as above. Let be the reverse lexicographic order induced by the ordering of variables . Then the reduced Gröbner basis of with respect to is
[TABLE]
where is such that is the reduced Gröbner basis of from Theorem 1.2.
Proof.
It is easy to see that belongs to . In the proof of Theorem 1.2, it is proved that each is of the form (2) with . Thus . Hence each belongs to and is a subset of . The initial monomial of each binomial in is and .
Suppose that is not a Gröbner basis of . By [11, Theorem 3.11], there exists an irreducible binomial such that . Then . Since in Theorem 1.2 is a Gröbner basis of , there exists such that divides . If , then there exists such that , a contradiction. Hence and is divisible by . Since is irreducible, the monomial does not contain . This contradicts the definition of . Thus is a Gröbner basis of . Moreover, since is the reduced Gröbner basis of and and do not appear in any , it follows that is reduced . ∎
Let be a unimodular configuration and set . Assume that . The toric ideal of is the kernel of a ring homomorphism
[TABLE]
defined by , for each , and , .
Theorem 1.4**.**
Work with the same notation as above. Let be the reverse lexicographic order induced by the ordering of variables . Then the reduced Gröbner basis of with respect to is
[TABLE]
where is such that is the reduced Gröbner basis of from Theorem 1.2.
Proof.
Each belongs to since . Since each belongs to , the set is a subset of . The initial monomial of each binomial in is and . Note that .
Suppose that is not a Gröbner basis of . By [11, Theorem 3.11], there exists an irreducible binomial such that . Let
[TABLE]
Then we have
[TABLE]
and . Moreover since is a configuration, there exists a vector such that the inner product for all . Taking the inner product of equation (4) with , we have
[TABLE]
Thus .
If , then . Then belongs to . This contradicts that is a Gröbner basis of . Hence at least one of , , , is positive. Since is irreducible, we may assume that and . Then and hence . Thus and , that is,
[TABLE]
It then follows that
[TABLE]
belongs to . Since is a Gröbner basis of , there exists such that divides . Since there exists such that , this is a contradiction. ∎
2. Proofs of Theorems
In the present section, we give proofs of Theorems 0.1 and 0.2 by using the Gröbner bases constructed in Section 1. First, we recall the theory of the -polynomials of lattice polytopes. Two lattice polytopes and are said to be unimodularly equivalent if there exists an affine map from the affine span of to the affine span of that maps bijectively onto and that maps to . Note that every lattice polytope is unimodularly equivalent to a full-dimensional one. Let be a lattice polytope of dimension . Given a positive integer , we define
[TABLE]
where . Ehrhart [9] proved that is a polynomial in of degree with the constant term . We say that is the Ehrhart polynomial of . Clearly, if and are unimodularly equivalent, then one has . The generating function of the lattice point enumerator, i.e., the formal power series
[TABLE]
is called the Ehrhart series of . It is well known that it can be expressed as a rational function of the form
[TABLE]
Then is a polynomial in of degree at most with nonnegative integer coefficients ([19]) and it is called the -polynomial (or the -polynomial) of . A characterization of Gorenstein polytopes in terms of their -polynomials is known. In fact, a lattice polytope of dimension is Gorenstein of index if and only if its -polynomial is of degree and palindromic, i.e., ([8]).
We say that a lattice polytope possesses the integer decomposition property if for any and for any , there exist lattice points in with , and we call a lattice polytope with the integer decomposition property an IDP polytope. IDP polytopes turn up in many fields of mathematics such as algebraic geometry, where they correspond to projectively normal embeddings of toric varieties, and commutative algebra, where they correspond to standard graded Cohen-Macaulay domains (see [6]). Moreover, the integer decomposition property is particularly important in the theory and application of integer programing [18, §22.10]. Note that a lattice polytope with a unimodular triangulation is IDP, and an IDP polytope is spanning. Moreover, a lattice polytope is IDP if and only if its -polynomial coincides with the -polynomial of its toric ring.
We turn to the review of indispensable lemmata for our proofs of Theorems 0.1 and 0.2.
Lemma 2.1** ([10, Corollary 6.1.5]).**
Let be a polynomial ring and a graded ideal of . Fix a monomial order on . Then and have the same Hilbert function, in particular, they have the same -polynomial.
Since a lattice polytope is unimodularly equivalent to a lattice polytope if and only if is unimodularly equivalent to and since any initial ideal given in Section 1 is squarefree, we can use the following lemma.
Lemma 2.2** ([13, Theorem 2.2]).**
Let be spanning lattice polytopes of dimension . Suppose that the toric ideal of has a squarefree initial ideal. Then the toric ideal of has a squarefree initial ideal, and both and have a regular unimodular triangulation and are IDP.
Now, we prove Theorems 0.1 and 0.2.
Proof of Theorem 0.2.
Let be a unimodular configuration and set . Assume that and is spanning. From Theorem 1.4, the toric ideal has a squarefree initial ideal. Hence by Lemma 2.2, the toric ideal of has a squarefree initial ideal, and both and have a regular unimodular triangulation and are IDP. Then [21, Theorem 0.4] guarantees that .
On the other hand, the minimal set of monomial generators of the initial ideals and given in Theorems 1.2 and 1.4 are the same. Thus
[TABLE]
and
[TABLE]
Since is IDP, it follows from Lemma 2.1 that
[TABLE]
Here (5) and (7) follow from Lemma 2.1, (6) follows from the above, and (8) holds since is IDP. From Proposition 1.1, is palindromic and of degree , and so is . Since the dimension of is , is Gorenstein of index . By [3, Theorem 2.6], is reflexive. ∎
Proof of Theorem 0.1.
The proof is the same as the proof of Theorem 0.2 except for the following discussion. Comparing the initial ideals and given in Theorems 1.2 and 1.3, it follows that
[TABLE]
and
[TABLE]
Then , and hence
[TABLE]
Since is IDP, it follows from Lemma 2.1 that
[TABLE]
From Proposition 1.1, is palindromic and of degree , and hence is palindromic and of degree . Since the dimension of is , is Gorenstein of index . ∎
From the proof of Theorems 0.1 and 0.2 we obtain the following Corollary.
Corollary 2.3**.**
Let be a unimodular configuration and set . Assume that , and both and are spanning. Then one has
[TABLE]
3. Unimodular configurations arising from finite simple graphs
Let be a finite connected simple graph on the vertex set with the edge set . Here a graph is called simple if has no loops and no multiple edges. Given an edge of , let . The edge polytope of is , where is the configuration defined by
[TABLE]
Since is a -polytope, we have . It is known by [16, Proposition 1.3] that
[TABLE]
A classification of the graphs such that is unimodular is as follows:
Proposition 3.1** ([17, Theorem 3.3]).**
Let be a finite connected simple graph. Then the following conditions are equivalent:**
- (i)
The toric ring is normal;**
- (ii)
The toric ideal has a squarefree initial ideal;**
- (iii)
The configuration is unimodular (by deleting a redundant row if is bipartite);**
- (iv)
All pairs of odd cycles in have a common vertex.
It follows from [12] that is always spanning.
Lemma 3.2** ([12, Proof of Corollary 3.4]).**
Let be a finite connected graph. Then is spanning.
Hence we obtain the following.
Theorem 3.3**.**
Let be a finite connected simple graph on . Assume that all pairs of odd cycles in have a common vertex. Then
- (1)
* is Gorenstein of index with a regular unimodular triangulation*;** 2. (2)
* is reflexive with a regular unimodular triangulation. In particular, is a nef-partition, where is an arbitrary lattice point in ;* 3. (3)
One has .
On the other hand, in general, is not always spanning even if is unimodular.
Example 3.4**.**
Let be a cycle of length , i.e., . Then
[TABLE]
is unimodular. On the other hand, is not spanning.
We determine when is spanning.
Lemma 3.5**.**
Let be a finite connected simple graph. Then is spanning if and only if is bipartite.
Proof.
Note that a full-dimensional lattice polytope with is spanning if and only if it holds .
We assume that is not bipartite. Then is full-dimensional. Since for any lattice point , is even, it follows that for any lattice point , is even. Hence is not spanning.
Conversely, we assume that is bipartite. Let be a configuration obtained by deleting a row of . Then is unimodularly equivalent to a full-dimensional lattice polytope . It is known by [18, Example 1 (p.273)] that any nonzero maximal minor of is . Thus , and hence is spanning. ∎
Therefore, we have obtain the following.
Theorem 3.6**.**
Let be a finite connected simple bipartite graph on . Then
- (1)
* is Gorenstein of index with a regular unimodular triangulation*;** 2. (2)
* is reflexive with a regular unimodular triangulation. In particular, is a nef-partition*;** 3. (3)
One has ; 4. (4)
One has .
Acknowledgment**.**
The authors are grateful to an anonymous referee for his careful reading of the manuscript and for his useful comments. The authors were partially supported by JSPS KAKENHI 18H01134, 19K14505 and 19J00312.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. V. Batyrev. Dual polyhedra and mirror symmetry for Calabi-Yau hypersurfaces in toric varieties. J. Algebraic Geom. , 3:493–535, 1994.
- 2[2] V. V. Batyrev and D. Juny. Classification of Gorenstein toric del Pezzo varieties in arbitrary dimension. Mosc. Math. J. , 10:285–316, 2010.
- 3[3] V. V. Batyrev and B. Nill. Combinatorial aspects of mirror symmetry. Contemp. Math. , 452:35–66, 2008.
- 4[4] V. V. Batyrev and D. van Straten. Generalized hypergeometric functions and rational curves on Calabi-Yau complete intersections in toric varieties. Comm. Math. Phys. , 168(3):493–533, 1995.
- 5[5] L. A. Borisov. Towards the Mirror Symmetry for Calabi-Yau Complete Intersections in Gorenstein Toric Fano Varieties. math.AG/0308216 , 1993.
- 6[6] W. Bruns and J. Gubeladze. Polytopes, rings, and K 𝐾 K -theory . Springer Monographs in Mathematics. Springer, Dordrecht, 2009.
- 7[7] D. A. Cox, J. B. Little, and H. K. Schenck. Toric varieties , volume 124 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2011.
- 8[8] E. De Negri and T. Hibi. Gorenstein algebras of Veronese type. J. Algebra , 193:629–639, 1997.
