This paper classifies Gorenstein simplices with specific $delta$-polynomials related to prime integer volumes, focusing on cases where the volume is either a square of a prime or a product of two distinct primes.
Contribution
It provides a complete classification of Gorenstein simplices with certain $delta$-polynomials for prime power and product of primes volumes, extending known results.
Findings
01
Classified Gorenstein simplices with $delta$-polynomials for $v=p^2$ and $v=pq$
02
Determined the number of such simplices up to unimodular equivalence
03
Extended the understanding of lattice polytopes with given $delta$-polynomials
Abstract
To classify the lattice polytopes with a given δ-polynomial is an important open problem in Ehrhart theory. A complete classification of the Gorenstein simplices whose normalized volumes are prime integers is known. In particular, their δ-polynomials are of the form 1+tk+⋯+t(v−1)k, where k and v are positive integers. In the present paper, a complete classification of the Gorenstein simplices with the above δ-polynomials will be performed, when v is either p2 or pq, where p and q are prime integers with p=q. Moreover, we consider the number of Gorenstein simplices, up to unimodular equivalence, with the expected δ-polynomial.
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.
Full text
Gorenstein simplices with a given δ-polynomial
Takayuki Hibi
Department of Pure and Applied Mathematics,
Graduate School of Information Science and Technology,
Osaka University,
Suita, Osaka 565-0871, Japan
To classify the lattice polytopes
with a given δ-polynomial is an important open problem in Ehrhart theory.
A complete classification of the Gorenstein simplices whose normalized volumes are prime integers is known.
In particular, their
δ-polynomials are
of the form 1+tk+⋯+t(v−1)k,
where k and v are positive integers.
In the present paper, a complete classification of the Gorenstein simplices with the above δ-polynomials will be performed,
when v is either p2 or pq, where p and q are prime integers
with p=q. Moreover, we consider the number of Gorenstein simplices, up to unimodular equivalence,
with the expected δ-polynomial.
To classify the lattice polytopes
with a given δ-polynomial is an important open problem among the study on lattice polytopes.
A lattice polytope is a convex polytope
P⊂Rd all of whose vertices have integer coordinates.
Recall from [4] and [6, Part II]
what the δ-polynomial of P is.
Let P⊂Rd be a lattice polytope of dimension d
and define δ(P,t) by the formula
[TABLE]
where nP={na:a∈P}, the nth dilated
polytopes of P.
It follows that δ(P,t) is a polynomial in t
of degree at most d.
We say that δ(P,t)
is the δ-polynomial or h∗-polynomial of P.
Let δ(P,t)=δ0+δ1t+⋯+δdtd.
Then δ0=1, δ1=∣P∩Zd∣−(d+1) and δd=∣(P∖∂P)∩Zd∣, where ∂P is the boundary of P,
and each δi≥0.
When δd=0, one has δi≥δ1
for 1≤i≤d.
Moreover, δ(P,1)=∑i=0dδi
coincides with the normalized volumeVol(P) of P.
A lattice polytope P⊂Rd of dimension d
is called reflexive if the origin of Rd belongs to
the interior of P and the dual polytope
([6, pp. 103–104]) of P is again
a lattice polytope. A lattice polytope P⊂Rd
of dimension d is called Gorenstein of indexr if rP is unimodularly equivalent to a reflexive polytope.
It is known that
P⊂Rd is Gorenstein if and only if the δ-polynomial
δ(P,t)=δ0+δ1t+⋯+δsts,
where δs=0 is palindromic, i.e.,
δi=δs−i for each 0≤i≤⌊s/2⌋.
Gorenstein polytopes are of interest in commutative algebra,
mirror symmetry and tropical geometry ([1, 11]).
In each dimension, there exist only finitely many Gorenstein polytopes
up to unimodular equivalence ([13])
and, in addition, Gorenstein polytopes are completely classified
up to dimension 4 ([12]).
Recently certain classification results of higher-dimensional
Gorenstein polytopes are obtained by [3, 9, 16].
The final goal of one of our research projects is to classify
the Gorenstein simplices with given δ-polynomials.
Classification problems of lattice simplices have been studied by many authors and there are several related works (e.g., see [5, 10]).
In [16, Corollary 2.4] it is shown that if
Δ is a Gorenstein simplex whose normalized volume
Vol(Δ) is a prime integer p, then its
δ-polynomial is of the form
[TABLE]
where k is a positive integer (Proposition 3.1).
In the present paper, from the fact we focus on the following problem:
Problem 0.1**.**
Given positive integers k and v,
classify the Gorenstein simplices with the δ-polynomial
1+tk+⋯+t(v−1)k.
A lattice simplex is called empty
if it possesses no lattice point except for its vertices.
A lattice simplex Δ
with δ(Δ,t)=δ0+δ1t+⋯+δdtd
is empty if and only if δ1=0.
In particular, in Problem 0.1, when k>1,
its target is Gorenstein empty simplices.
The present paper is organized as follows:
Section 1 consists of the review of fundamental materials
on lattice simplices and the collection of indispensable lemmata.
We devote Section 2 to discuss a lower bound on the dimensions
of Gorenstein simplices with a given δ-polynomial
of Problem 0.1 and, in addition, to classify
the Gorenstein simplices when the lower bound holds (Proposition 2.1).
The highlight of this paper is Section 3, where
a complete answer of Problem 0.1 will be given when v is
either p2 or pq, where p and q are distinct prime integers (Theorems 3.7 and 3.8).
Finally, in Section 4,
we will discuss
the number of Gorenstein simplices, up to unimodular equivalence,
with a given δ-polynomial of Problem 0.1.
Acknowledgment
The authors would like to thank anonymous referees for reading the manuscript carefully.
The second author was partially supported by Grant-in-Aid for JSPS Fellows 16J01549.
1. Preliminaries
In this section, we recall basic materials on lattice simplices and we prepare the essential lemmata in this paper.
At first, we introduce the associated finite abelian groups of lattice simplices.
For a lattice simplex Δ⊂Rd of dimension d whose vertices are v0,…,vd∈Zd
set
[TABLE]
The collection ΛΔ forms a finite abelian group with addition defined as follows:
For (λ0,…,λd)∈(R/Z)d+1 and (λ0′,…,λd′)∈(R/Z)d+1, (λ0,…,λd)+(λ0′,…,λd′)=(λ0+λ0′,…,λd+λd′)∈(R/Z)d+1.
We denote the unit of ΛΔ by 0, and the inverse of x by −x,
and also denote jx+⋯+x by jx for an integer j>0 and x∈ΛΔ.
For x=(x0,…,xd)∈ΛΔ, where each xi is taken with 0≤xi<1, we set
ht(x)=∑i=0dxi∈Z
and ord(x)=min{ℓ∈Z>0:ℓx=0}.
It is well known that the δ-polynomial of the lattice simplex Δ can be computed as follows:
Lemma 1.1**.**
Let Δ be a lattice simplex of dimension d whose δ-polynomial equals 1+δ1t+⋯+δdtd.
Then for each i, we have δi=♯{λ∈ΛΔ:ht(λ)=i}.
Recall that a matrix A∈Zd×d is unimodular if det(A)=±1.
For lattice polytopes P,Q⊂Rd of dimension d, P and Q are called unimodularly equivalent if there exist a unimodular matrix U∈Zd×d and an integral vector w∈Zd such that Q=fU(P)+w, where fU is the linear transformation in Rd defined by U, i.e., fU(v)=vU for all v∈Rd.
In [2], it is shown that there is a bijection between unimodular equivalence classes of d-dimensional lattice simplices with a
chosen ordering of their vertices and finite subgroups of (R/Z)d+1 such that the sum of all entries of each element is an integer.
In particular, two lattice simplices Δ and Δ′ are unimodularly equivalent if and only if there exist orderings of their vertices such that ΛΔ=ΛΔ′.
For a lattice polytope P⊂Rd of dimension d, the lattice pyramid over P is defined by conv(P×{0},(0,…,0,1))⊂Rd+1. Let Pyr(P) denote this polytope. We use the term lattice pyramid for a lattice polytope that has been obtained by successively taking lattice pyramids.
A characterization of lattice pyramids in terms of the associated finite abelian groups is known.
Let Δ⊂Rd be a lattice simplex of dimension d.
Then Δ is a lattice pyramid if and only if there is i∈{0,…,d} such that λi=0 for all (λ0,…,λd)∈ΛΔ.
For a lattice polytope P⊂Rd of dimension d, one has δ(P,t)=δ(Pyr(P),t).
Therefore, it is essential that we characterize polytopes which are not lattice pyramids over any lower-dimensional lattice simplex.
Finally, we give some lemmata.
These lemmata are characterizations of some Gorenstein simplices in terms of the associated finite abelian groups.
Let p be a prime integer and Δ⊂Rd a d-dimensional lattice simplex whose normalized volume equals p2.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then Δ is Gorenstein of index r if and only if one of the followings is satisfied:
(1)
There exists an integer s with 0≤s≤d−1 such that rp2−1=(d−s)+ps and ΛΔ
is generated by s1/p,…,1/p,d−s+11/p2,…,1/p2
for some ordering of the vertices of Δ, or
2. (2)
d=rp−1* and there exist integers 0≤a0,…,ad−2≤p−1
with p∣(a0+⋯+ad−2−1)
such that ΛΔ is generated by
((a0+1)/p,…,(ad−2+1)/p,0,1/p)
and ((p−a0)/p,…,(p−ad−2)/p,1/p,0)
for some ordering of the vertices of Δ.*
Let p and q be prime integers with p=q and
Δ⊂Rd a d-dimensional lattice simplex whose normalized volume equals pq.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then Δ is Gorenstein of index r if and only if
there exist nonnegative integers s1,s2,s3 with s1+s2+s3=d+1 such that the following conditions are satisfied:
(1)
rpq=s1q+s2p+s3, and
2. (2)
ΛΔ* is generated by
s11/p,…,1/p,s21/q,…,1/q,s31/(pq),…,1/(pq) for some ordering of the vertices of Δ.*
2. Existence
In this section, we prove that for positive integers k and v, there exists a lattice simplex with the δ-polynomial 1+tk+t2k+⋯+t(v−1)k.
Moreover, we give a lower bound and an upper bound on the dimension of such a lattice simplex which is not a lattice pyramid.
In fact, we obtain the following proposition.
Proposition 2.1**.**
Let v and k be positive integers.
Then there exists a Gorenstein simplex Δ⊂Rd of dimension d whose δ-polynomial is
1+tk+t2k+⋯+t(v−1)k.
Furthermore, if Δ is not a lattice pyramid over any lower-dimensional lattice simplex,
then one has vk−1≤d≤4(v−1)k−2.
In particular, the lower bound holds if and only if ΛΔ is generated by (1/v,…,1/v).
Proof.
Let Δv,k be a lattice simplex such that ΛΔv,k is generated by (1/v,…,1/v), where d=vk−1.
Then it follows from Lemma 1.1 that δ(Δv,k,t)=1+tk+t2k+⋯+t(v−1)k.
Now, let Δ⊂Rd be a lattice simplex of dimension d whose
δ-polynomial is
1+tk+t2k+⋯+t(v−1)k.
Let x=(x0,…,xd)∈ΛΔ be an element such that ht(x)=(v−1)k.
Then we have that ht(−x)≥k.
Hence since ht(x)+ht(−x)≤d+1, we obtain d≥vk−1.
From [14, Theorem 7], if Δ is not a lattice pyramid over any lower-dimensional lattice simplex,
then one has d≤4(v−1)k−2.
Now, we assume that d=vk−1.
Since for each i, one has 0≤xi≤(v−1)/v,
we obtain ht(x)≤(d+1)(v−1)/v=(v−1)k.
Hence for each i, it follows that xi=(v−1)/v.
Therefore ΛΔ is generated by (1/v,…,1/v).
Then it is easy to show that
δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k,
as desired.
3. Classification
In this section, we give a complete answer of Problem 0.1 for the case that v is the product of two prime integers.
First, we consider the case where v is a prime integer.
The following proposition motivates us to consider Problem 0.1.
Let p be a prime integer and Δ⊂Rd a Gorenstein simplex of index r whose normalized volume equals p.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then d=rp−1 and ΛΔ is generated by (1/p,…,1/p).
Furthermore, one has
δ(Δ,t)=1+tr+t2r+⋯+t(p−1)r.
This theorem says that for any positive integers k and v, if v is a prime integer, then there exists just one lattice simplex up to unimodular equivalence such that its δ-polynomial equals 1+tk+t2k+⋯+t(v−1)k.
By the following proposition, we know that if v is not a prime integer, then there exist at least two such simplices up to unimodular equivalence.
Proposition 3.2**.**
Given positive integers k, v and a proper divisor u of v, let Δ⊂Rd be a lattice simplex of dimension d such that
ΛΔ is generated by
[TABLE]
Then one has
δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k.
Proof.
Set x=(v−1)ku/v,…,u/v,uk1/v,…,1/v and y=(v/u)x=(v−1)k0,…,0,uk1/u,…,1/u.
Then we obtain ht(x)=uk and ht(y)=k.
Moreover, it follows that
[TABLE]
For any integers 0≤i≤v/u−1 and 0≤j≤u−1,
one has
[TABLE]
Hence, it follows from Lemma 1.1 that δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k, as desired.
Furthermore, the following proposition can immediately be obtained from Lemma 1.1.
Proposition 3.3**.**
Given positive integers v1,v2 and k,
let Δ1⊂Rd1 and Δ2⊂Rd2 be Gorenstein simplices of dimension d1 and d2 such that δ(Δ1,t)=1+tk+t2k+⋯+t(v1−1)k and
δ(Δ2,t)=1+tv1k+t2v1k+⋯+tv1(v2−1)k.
Let Δ⊂Rd1+d2+1 be a lattice simplex of dimension d1+d2+1 such that
[TABLE]
Then one has δ(Δ,t)=1+tk+t2k+⋯+t(v1v2−1)k.
In particular, if neither Δ1 nor Δ2 is not a lattice pyramid, then Δ is not a lattice pyramid.
Remark 3.4**.**
Let Δ,Δ1 and Δ2 be the Gorenstein simplices in Proposition 3.3. Then Δ is the join of Δ1 and Δ2.
Hence one has
[TABLE]
Now, we consider Problem 0.1 for the case that v is p2 or pq, where p and q are prime integers with p=q.
We see examples of a Gorenstein simplex whose δ-polynomial is 1+tk+t2k+⋯+t(v−1)k with the explicit vertex representation.
Given a sequence A=(a1,…,ad) of integers,
let Δ(A)⊂Rd be the convex hull of the origin of Rd and all row vectors of the following matrix:
[TABLE]
where the rest entries are all [math].
Given sequences B=(b1,…,bs) and C=(c1,…,cd) of integers with 1≤s<d,
let Δ(B,C)⊂Rd be the convex hull of the origin of Rd and all row vectors of the following matrix:
[TABLE]
where the rest entries are all [math].
By using Lemma 1.1, we can compute their δ-polynomials of the lattice simplices in the following propositions.
In fact, it is easy to determine all elements in their associated finite abelian groups.
Proposition 3.5**.**
Let p be a prime integer and k a positive integer, and we set the following sequences of integers:
(1)
A1=(p2k−21,…,1,p2);
2. (2)
A2=pk−11,…,1,(p2−1)k−1p,…,p,p2;
3. (3)
B=pk−11,…,1,p, C=pkp,…,p,p2k−21,…,1,p.
Then the δ-polynomial of each of Δ(A1), Δ(A2) and Δ(B,C) equals 1+tk+t2k+⋯+t(p2−1)k.
Proposition 3.6**.**
Let p and q be prime integers with p=q and k a positive integer, and we set the following sequences of integers:
Then the δ-polynomial of each of
Δ(A1), Δ(A2), Δ(A3), Δ(B1,C1) and Δ(B2,C2)
equals 1+tk+t2k+⋯+t(pq−1)k.
The following theorems are the main results of the present paper.
Theorem 3.7**.**
Let p be a prime integer and k a positive integer, and let Δ⊂Rd be a Gorenstein simplex of dimension d whose δ-polynomial is 1+tk+t2k+⋯+t(p2−1)k.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then one of the followings is satisfied:
(1)
d=p2k−1, or
2. (2)
d=p2k+(p−1)k−1, or
3. (3)
d=p2k+pk−1.
Moreover, in each case, a system of generators of the finite abelian group ΛΔ is the set of
row vectors of the matrix which can be written up to permutation of the columns as follows:
In particular, Δ is unimodularly equivalent to one of Δ(A1), Δ(A2) and Δ(B,C) as in Proposition 3.5.
Theorem 3.8**.**
Let p and q be prime integers with p=q and k a positive integer, and let Δ⊂Rd be a Gorenstein simplex of dimension d whose δ-polynomial is
1+tk+t2k+⋯+t(pq−1)k.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then one of the followings is satisfied:
(1)
d=pqk−1, or
2. (2)
d=pqk+pk−1, or
3. (3)
d=pqk+qk−1, or
4. (4)
d=pqk+(p−1)k−1, or
5. (5)
d=pqk+(q−1)k−1.
Moreover, in each case, the finite abelian group ΛΔ is generated by one element which can be written up to permutation of the coordinates as follows:
In particular, Δ is unimodularly equivalent to one of Δ(A1), Δ(A2), Δ(A3), Δ(B1,C1) and Δ(B2,C2) as in Proposition 3.6.
Remark 3.9**.**
The lattice simplices as in Theorems 3.7 and 3.8 can be constructed by Propositions 3.2 and 3.3.**
In order to prove Theorems 3.7 and 3.8,
we use the following lemma.
Lemma 3.10**.**
Let v and k positive integers,
and let Δ⊂Rd be a Gorenstein simplex of dimension d whose δ-polynomial equals
1+tk+t2k+⋯+t(v−1)k.
Assume that x∈(R/Z)d+1 is an element of ΛΔ such that ht(x)=k
and set m=ord(x).
Then by reordering the coordinates, we obtain x=s1/m,…,1/m,d−s+10,…,0
for some positive integer s.
Proof.
Since m=ord(x), x must be of a form (k1/m,…,ks/m,0,…,0) for a positive integer s and integers 1≤k1,…,ks≤m−1 by reordering the coordinates.
If there exists an integer ki≥2 for some 1≤i≤s, then one has ki(m−1)/m≥1.
Therefore, we obtain ht((m−1)x)<(m−1)ht(x)=(m−1)k.
Since m=ord(x), (m−1)x is different from 0,x,…,(m−2)x.
We remark that for any a, b∈(R/Z)d+1, one has ht(a+b)≤ht(a)+ht(b).
This fact and the supposed δ-polynomial imply that ht(tx)=tht(x)=tk for any 1≤t≤m−1.
This is a contradiction, as desired.
By Lemma 1.3, Δ is unimodularly equivalent to either Δ1 or Δ2, where Δ1 and Δ2 are lattice simplices such that each system of generators of ΛΔ1 and ΛΔ2 is the set of vectors of matrix as follows:
(i)
d−s+11/p⋯1/ps1/p2…1/p2∈(R/Z)1×(d+1);
2. (ii)
where s is a positive integer and 0≤a0,…,ad−2≤p−1 are integers.
At first, we assume that Δ is unimodularly equivalent to Δ1.
If s=d+1, then one has (d+1)/p2=k, hence, d=p2k−1.
This is the case (1).
Now, we suppose that s=d+1.
Let x be an element of ΛΔ1 with ht(x)=k.
Then by Lemma 3.10, one has x=d−s+10,…,0,s1/p,…,1/p,
hence s=pk.
Set y=d−s+11/p,…,1/p,s1/p2,…,1/p2. Since for any 1≤m≤p−1, ht(mx)=mk, we have ht(y)=pk.
Hence it follows that d−s+1=p2k−k, namely, d=p2k+(p−1)k−1.
This is the case (2).
Next, we assume that Δ is unimodularly equivalent to Δ2.
By Lemma 3.10, it follows that for any 0≤i≤d−2, ai∈{0,p−1}.
Hence by reordering the coordinates of ΛΔ2, we can assume that ΛΔ2 is generated by
[TABLE]
where 1≤s≤⌊(d+1)/2⌋.
Then since ht(x1)=k, one has s=pk.
Moreover, since ht(x2)=pk, we have d−s+1=p2k, namely,
d=p2k+pk−1.
Therefore, this is the case (3).
Conversely, in each case, it is easy to show that Δ is unimodularly equivalent to one of Δ(A1), Δ(A2) and Δ(B,C) as in Proposition 3.5, as desired.
By Lemma 1.4, we can suppose that ΛΔ is generated by
[TABLE]
where s1+s2+s3=d+1 with nonnegative integers s1,s2,s3.
If s1=s2=0, since ht(x)=k, one has d=pqk−1.
This is the case (1).
If s3=0, we can assume that ΛΔ is generated by
[TABLE]
with s1,s2>0.
Then it follows that ht(x1)=k and ht(x2)=pk, or ht(x1)=qk and ht(x2)=k.
Assume that ht(x1)=k and ht(x2)=pk.
Then one has s1=pk and s2=pqk.
Hence since d=pqk+pk−1, this is the case (2).
Similarly, we can show the case (3).
Next we suppose that s1,s2,s3>0.
Let a be an element of ΛΔ such that ht(a)=k.
By Lemma 3.10, we know that ord(a)=pq.
Hence, it follows that ord(a) equals p or q.
Now we assume that ord(a)=p.
By Lemma 3.10 again, a must be of a form s11/p,…,1/p,s20,…,0,s31/p,…,1/p.
Let b=(b1,…,bd+1) be an element of ΛΔ such that ht(b)=pk.
If there exists an index 1≤i≤s1 such that bi=n/p with an integer 1≤n≤p−1, then ht(b+(p−1)a)<ht(b)+(p−1)ht(a).
Since b+(p−1)a is different from 0,a,2a,…,(p−1)a,b,b+a,…,b+(p−2)a, this contradicts to that δΔ(t)=1+tk+t2k+⋯+t(pq−1)k.
Hence one obtains bi=0 for any 1≤i≤s1. Therefore, we can assume that b=s10,…,0,s2ℓ/q,…,ℓ/q,s3m/q,…,m/q for some positive integers ℓ,m.
Then whenever (g1,h1)=(g2,h2) with 0≤g1,g2≤p−1 and 0≤h1,h2≤q−1, g1a+h1b and g2a+h2b are different elements of ΛΔ.
Hence since δΔ(t)=1+tk+t2k+⋯+t(pq−1)k,
one has
[TABLE]
for any 0≤g≤p−1 and 0≤h≤q−1.
This implies that ℓ=m=1.
However since (p−1)/p+(q−1)/q>1, we have ht((p−1)a+(q−1)b)<(p−1)ht(a)+(q−1)ht(b), a contradiction.
Therefore, it does not follow s1,s2,s3>0.
Finally, we assume that s1=0 and s2>0.
Then one has ht(qx)=k, hence, s3=pk.
Moreover, since ht(x)=pk, we obtain s2=(pq−1)k.
Therefore, this is the case (4).
Similarly, we can show the case (5).
Conversely, it is easy to see that Δ is unimodularly equivalent to one of Δ(A1), Δ(A2), Δ(A3), Δ(B1,C1) and Δ(B2,C2) as in Proposition 3.6, as desired.
4. The number of Gorenstein simplices
In [7, Section 4], we asked how many reflexive polytopes which have the same δ-polynomial exist.
Analogy to this question, in this section, we consider how many Gorenstein simplices which have a given δ-polynomial of Problem 0.1 exist.
Given positive integers v and k, let N(v,k) denote the number of Gorenstein simplices,
up to unimodular equivalence,
which are not lattice pyramids over any lower-dimensional lattice simplex and whose δ-polynomials equal 1+tk+t2k+⋯+t(v−1)k.
For example,
from Proposition 3.1, N(p,k)=1 for any prime integer p.
Moreover, from Theorems 3.7 and 3.8,
N(p2,k)=3 and N(pq,k)=5 for any distinct prime integers p and q.
However, in other case, it is hard to determine N(v,k).
Therefore, our aim of this section is to construct more examples of Gorenstein simplices of Problem 0.1
and to give a lower bound on N(v,k).
The following theorem gives us more examples of Gorenstein simplices of Problem 0.1.
Theorem 4.1**.**
Given a positive integer v, let Δ⊂Rd be a lattice simplex of dimension d such that
ΛΔ is generated by
[TABLE]
where 1<v1<⋯<vt=v and for any 1≤i≤t−1, vi∣vi+1 and s1,…,st are positive integers.
Then δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k
with a positive integer k
if and only if
[TABLE]
where v0=1.
Proof.
Let
[TABLE]
and for i=1,…,t−1, we set xi=vix0.
Then it follows that
[TABLE]
Moreover, we obtain ht(xi)=∑j=1t−ivi+jvisi+j for i=0,…,t−1.
Since
[TABLE]
for any 1≤i≤t−1,
it follows that
for any 1≤i≤t−1, s_{i}=\Bigl{(}\dfrac{v_{t}}{v_{i-1}}-\dfrac{v_{t}}{v_{i+1}}\Bigr{)}k and st=vt−1vtk
if and only if for any 0≤i≤t−1, ht(xi)=vi+1vtk.
Hence we should prove that δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k if and only if
for any 0≤i≤t−1, ht(xi)=vi+1vtk.
At first, we assume that δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k.
By Lemma 3.10,
one has ht(xt−1)=k.
Suppose that for any n≤i≤t−1, ht(xi)=vi+1vtk with an integer 1≤n≤t−1.
Then since ht(∑i=nt−1(vi+1/vi−1)xi)=(vt/vn−1)k, there exists an integer m with 0≤m≤n−1 such that ht(xm)=vnvtk.
Now, we assume that m<n−1.
Set
[TABLE]
Then one has {ht(x):x∈Λ′}={jk:j=0,…,(vm+1vt)/(vmvn)−1}.
However,
[TABLE]
and xm+1 is not in Λ′, a contradiction.
Hence we obtain ht(xi−1)=vivtk for any 0≤i≤t−1.
Conversely, we assume that for any 0≤i≤t−1, ht(xi)=vi+1vtk.
Since for any ci with 0≤ci≤vi+1/vi−1, ht(∑i=0t−1cixi)=∑i=0t−1ciht(xi),
one has δ(Δ,t)=1+tk+t2k+⋯+t(v−1)k,
as desired.
By Theorems 4.1 and [16, Theorem 2.2], we can answer Problem 0.1
when v is a power of a prime integer and the associated finite abelian group is cyclic, namely,
it is generated by one element.
Corollary 4.2**.**
Let p be a prime integer, ℓ and k a positive integers,
and
let Δ⊂Rd be a lattice simplex of dimension d such that ΛΔ is cyclic and
δ(Δ,t)=1+tk+t2k+⋯+t(pℓ−1)k.
Suppose that Δ is not a lattice pyramid over any lower-dimensional lattice simplex.
Then there exist positive integers 0<ℓ1<⋯<ℓt=ℓ and s1,…,st
such that the following conditions are satisfied:
•
ΛΔ* is generated by*
[TABLE]
for some ordering of the vertices of Δ;
•
It follows that
[TABLE]
where ℓ0=0.
Now, we consider to give a lower bound on N(v,k).
Given positive integers v and k, let M(v,k) denote the number of Gorenstein simplices, up to unimodular equivalence,
which appeared in Theorem 4.1.
Then one has N(v,k)≥M(v,k).
By Theorem 4.1, we can determine M(v,k) in terms of the divisor lattice of v.
Given a positive integer v, let Dv the set of all divisors of v, ordered by divisibility.
Then Dv is a partially ordered set, in particular, a lattice, called the divisor lattice of v.
We call subset C⊂Dv a chain of Dv if C is a totally ordered subset with respect to the induced order.
Corollary 4.3**.**
Let v and k be positive integers.
Then M(v,k) equals the number of chains from a non-least element to the greatest element in Dv.
In particular, one has M(v,k)=∑n∈Dv∖{v}M(n,k).
We give examples of M(v,k).
Example 4.4**.**
(1) Let v=pℓ with a prime integer p and a positive integer ℓ.
Then from Corollary 4.3, we know that M(v,k) equals
the number of subsets of {1,…,ℓ−1}.
Hence one has M(v,k)=2ℓ−1.
(2) Let v=p1⋯pt, where p1,…,pt are distinct prime integers.
From Corollary 4.3, we know that M(v,k) depends only on t.
Now, let a(t)=M(v,k), where we define a(0)=M(1,k)=1.
Then one has
[TABLE]
We remark that a(t) is the well-known recursive sequence ([15, A000670]) which is called the ordered Bell numbers or Fubini numbers.
**
Corollary 4.3 says that M(v,k) depends only on the divisor lattice Dv.
In particular, letting v=p1a1⋯ptat with distinct prime integers p1,…,pt and positive integers a1,…,at, M(v,k) depends only on (a1,…,at).
On the other hand, N(v,k) depends only on the divisor lattice Dv when v is a prime integer or the product of two prime integers.
Therefore, we conjecture the following:
Conjecture 4.5**.**
Let v and k be positive integers. Then N(v,k) depends only on the divisor lattice Dv of v.
Let P be a lattice polytope whose δ-polynomial is
1+tk+⋯+t(v−1)k with some positive integers v and k.
If k>1, then P is a simplex.
However, if k=1, then P is not always a simplex.
We see the list of the Gorenstein non-simplices whose δ-polynomials are 1+t+⋯+tv−1 when 2≤v≤4.
Let v be a positive integer with 2≤v≤4 and P a Gorenstein non-simplex whose δ-polynomial is 1+t+⋯+tv−1.
Suppose that P is not a lattice pyramid over any lower-dimensional lattice polytope.
(a)
When v=2, P is unimodularly equivalent to a unit square.
2. (b)
When v=3, P is unimodularly equivalent to the lattice polytope which is the convex hull of
(1)
0,e1,e2,e3,e1+e2−2e3∈R3, or
2. (2)
0,e1,e2,e3,e4,−e1−e2+e3+e4∈R4.
3. (c)
When v=4, P is unimodularly equivalent to the lattice polytope which is the convex hull of
(1)
0,e1,e2,e3,e4,−e1−e2−e3+e4∈R4, or
2. (2)
0,e1,e2,e3,e4,−e1−e2−e3+2e4∈R4, or
3. (3)
0,e1,e2,e3,e4,e5,−2e1−e2+e3+e4+e5∈R5, or
4. (4)
0,e1,e2,e3,e4,e5,e6,−e1−e2−e3+e4+e5+e6∈R6, or
5. (5)
0,e1,e2,e3,e2+e3+2e4,−e1+e2∈R4, or
6. (6)
0,e1,e2,e3,e4,e3+e4+2e5,e1+e2∈R5, or
7. (7)
Here 0 is the origin of Rd and e1,…,ed are the canonical unit coordinate vectors of Rd.
Therefore, the number of Gorenstein polytopes up to unimodular equivalence, which are not lattice pyramids over any lower-dimensional lattice polytope and whose δ-polynomials equal 1+t+⋯+tv−1 with some positive integer v does not depend only on the divisor lattice Dv of v.
Bibliography16
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] V. Batyrev, Dual polyhedra and mirror symmetry for Calabi-Yau hypersurfaces in toric varieties, J. Algebraic Geom. 3 (1994), 493–535.
2[2] V. V. Batyrev and J. Hofscheier, Lattice polytopes, finite abelian subgroups in SL ( n , ℂ ) SL 𝑛 ℂ \textnormal{SL}(n,{\mathbb{C}}) and coding theory, ar Xiv:1309.5312.
3[3] V. Batyrev and D. Juny, Classification of Gorenstein toric del Pezzo varieties in arbitrary dimension, Mosc. Math. J. , 10 (2010), 285–316.
4[4] M. Beck and S. Robins, Computing the continuous discretely , Undergraduate Texts in Mathematics, Springer, New York, second edition, 2015. Integer-point enumeration in polyhedra, With illustrations by David Austin.
5[5] B. Braun, R. Davis and L. Solus, Detecting the integer decomposition property and Ehrhart unimodality in reflexive simplices, Advances in Applied Mathematics , 100 (2018), 122–142.
6[6] T. Hibi, “Algebraic Combinatorics on Convex Polytopes,” Carslaw Publications, Glebe NSW, Australia, 1992.
7[7] T. Hibi and A. Tsuchiya, Facets and volume of Gorenstein Fano polytopes, Math. Nachr. , 290 (2017), 2619–2628.
8[8] T. Hibi and A. Tsuchiya, Classification of lattice polytopes with small volumes, J. Comb , to appear.