WorksMathematics
Reflexive polytopes can have doubly exponentially many vertices
Abstract
Reflexive polytopes are lattice polytopes containing the origin in their interior such that also the dual polytope is a lattice polytope. On the basis of low-dimensional observations and of bounds known for special classes of reflexive polytopes, the second author conjectured in 2004 that the number of vertices of -dimensional reflexive polytopes is bounded from above by . In this note, we present counterexamples showing that this conjecture is false in every dimension . In fact, rather surprisingly, in sufficiently large dimensions the number of vertices (equivalently, by duality, the number of facets) can be as large as theoretically possible, namely doubly exponential in . These results were found using GPT-6.1 Sol.
The original conjecture
A polytope is called lattice polytope if the vertices of are elements of . In 1994 Batyrev [4] defined a reflexive polytope to be a full-dimensional lattice polytope containing the origin in its interior such that its polar polytope
is also a lattice polytope. Hence, reflexivity is invariant under polar duality. In the toric dictionary, reflexive polytopes correspond to Gorenstein toric Fano varieties and have been used to construct Calabi-Yau varieties relevant for mirror symmetry. We refer to [3] for more background on this.
Recall that two lattice polytopes are considered isomorphic if there is an affine-unimodular transformation mapping them onto each other. As a reflexive polytope contains only the origin as an interior lattice point, there are only finitely many reflexive polytopes of each dimension up to isomorphisms [4, 18, 22].
In his PhD thesis the second author studied reflexive polytopes and posed the following conjecture, which was published as Conjecture 5.2 in [25] and discussed in more detail in [6]. For this, we need to define
which is the (up to isomorphism unique) reflexive hexagon. Note that is isomorphic to .
Conjecture 1.1. Let be a -dimensional reflexive polytope. Then its number of vertices is bounded from above by with equality if and only if is even and is isomorphic to .
Equivalently, by duality, the conjecture can be reformulated for the number of facets (as in Conjecture 1.1 in [23]) on which we will focus from now on. Recall that the free sum of two lattice polytopes and is defined as the convex hull in of and . If and are full-dimensional and contain the origins in their interiors, then . Using this notion, Conjecture 1.1 can be restated as follows:
Conjecture 1.2 (Dual version). Let be a -dimensional reflexive polytope. Then its number of facets is bounded from above by with equality if and only if is even and is isomorphic to the free sum of reflexive hexagons .
Evidence for the conjecture came from the following facts. It holds up to dimension 4 by the classification results of Kreuzer and Skarke [21]. It holds for simple reflexive polytopes [12]. It holds for simplicial reflexive polytopes with a centrally-symmetric pair of facets [26]. Recently, it was also verified for some classes of reflexive polytopes associated to graphs and posets [23, 24].
The counterexamples in dimensions 8 and 9
Using GPT-6.1 Sol we found counterexamples in dimensions as low as 8 and 9. Let us describe these examples. Their properties can easily be checked using standard polyhedral software and consumer hardware.
Define a three-dimensional lattice polytope as the convex hull of the following 21 lattice points in :
Define in the lattice polytope as the convex hull of
The reader may look at the end of the paper where we list the vertices on the left side.
Theorem 2.1. is an 8-dimensional reflexive polytope with vertices and facets. Hence, Conjecture 1.2 fails in dimension 8.
For dimension 9 we define as the convex hull of the following 15 lattice points in :
Now, we define in the lattice polytope as the convex hull of
Also here we list the vertices at the end of the paper on the right side.
Theorem 2.2. is a 9-dimensional reflexive polytope with vertices and facets. Hence, Conjecture 1.2 fails in dimension 9.
In particular, it fails also in any dimension at least 10 by just taking sufficiently many free sums of or with .
The construction behind the counterexamples
Consider the reflexive polytope from Theorem 2.1. Combinatorially it is a two-fold pyramid over the free sum . Here are two important observations:
has the origin in its interior, however, it is not reflexive, but its 37 facets have lattice distances 1, 3 or 6 from the origin. By considering free sums (or dually products) of non-reflexive lattice polytopes as the starting point one clearly has a lot of flexibility compared to previous approaches starting with low-dimensional reflexive polytopes.
Next, choosing the apices of the two-fold pyramids in this specific way, all lattice distances of the facets become just 1. This is essentially the same idea as in Haase and Melnikov [16] where they show that any lattice polytope can be embedded as the face of a high-dimensional reflexive polytope. However, while they use a wedge construction which decreases the lattice distance a priori just for one facet, choosing pyramids affects all the facets at once, which makes the operation efficient enough to get counterexamples to the conjecture. And also this idea is already contained in the paper of Haase and Melnikov in their Proposition 4.2! Namely, they use precisely this approach together with number-theoretic considerations to bound the increase of dimensions needed to embed a lattice interval as the edge of a reflexive polytope (their Corollary 4.3).
In what follows, we adopt the very same approach by Haase and Melnikov in order to generalize and optimize this construction to higher-dimensions.
First, let us make the two-fold pyramid construction for more precise. Consider the reflexive triangle with vertices , , . Notice that can be described by keeping the last two vertices of and replacing the vertex with .
In order to generalize this let us recall that for every reflexive -simplex there is an associated unit partition:
with positive integers such that
If all are pairwise distinct, then this is called an Egyptian fraction. The converse also holds (see [27 Theorem 4.3], and originally [14 Proposition 5.1] and [4 Theorem 5.4.3]).
Lemma 3.1. For each unit partition with integers there exists a reflexive -dimensional simplex with vertices such that .
For instance, in our 8-dimensional counterexample with we have :
and
Next, let us generalize the Haase-Melnikov pyramid construction. Here, denotes the set of facets of a polytope .
Lemma 3.2. Let be an -dimensional lattice polytope with in its relative interior. Let be an -dimensional reflexive simplex with vertices , and associated unit partition with denominators . If the lattice distance of each facet of from the origin divides , then the convex hull of
is an -dimensional reflexive polytope . This polytope is combinatorially an -fold pyramid over the base face . In particular, its number of facets is .
Proof. For let be the integral inward facet normal of the facet of with vertices . There are integers such that we have for the equalities . Next, we write the facet inequalities (say, many) of as with a primitive integral functional and integers for .
Combinatorially, the polytope is an -fold pyramid over . Hence, we know its facets: they are given by the convex hull of all vertices except for one of the apices , or by the convex hull of a facet of together with all apices . Thus, the facet inequalities of are given as
for all . Note that these linear functions are integral by our assumption as (for ) are the lattice distances of the facets of from the origin. Thus, is reflexive. □
As a reality check the reader can verify that in our 9-dimensional counterexample the facet lattice distances of the lattice polygon (and thus of ) are all divisors of 42, while the 3-dimensional reflexive simplex with vertices has denominators 42, 7, 3, 2 in its unit partition.
Remark 3.3. Lemma 3.2 is a direct generalization of Proposition 4.2 in [16] due to Haase and Melnikov, where was assumed to be a suitable dilate of a reflexive polytope. In fact, another way to look at Lemma 3.2 is that this construction is just the free sum of and where the point of intersection is the vertex of . Free sums of lattice polytopes that intersect on the boundary appear at several places in the literature, e.g., [8, 5, 9] among others, and also the Haase-Melnikov wedge construction [16] can be seen as a special dual instance of this. The examples of hollow lattice polytopes by Codenotti and Santos [13] are free sums with intersection on the boundary. Even the spectacular recent counterexamples by Ferroni to the IDP unimodality conjecture [15] are Chimney polytopes [17], whose polars are consecutive free sums. It seems to us that the full potential of these boundary-free-sums constructions and their dual wedge constructions for finding interesting (counter)examples is just about to be completely realized by our community.
The general result
Now, the strategy to optimize the bounds in higher dimensions becomes clear. We need to find lattice polytopes containing the origin in their interiors that have as many facets as possible while the least common multiple of their facet lattice distances from the origin should be as small as possible, so that the reflexive simplex one needs to get a reflexive polytope should hopefully add as few dimensions as possible.
As it turns out, it is enough to consider this problem in dimension two and then just take sufficiently many free sums of a good candidate polygon with itself. In order to define these lattice polygons, let and let be the number of positive divisors of . We define the lattice polygon
In the following denotes the set of vertices of a polytope .
Figure 1. The lattice polygons .
Lemma 4.1. The lattice polygon satisfies the following properties:
,
, and thus, ,
the lattice distance of each facet from the origin divides .
Proof. The triangle is contained in and does contain the origin in its interior. Hence, contains the origin in its interior.
It is straightforward to verify that the following defines a supporting hyperplane for that cuts out the vertex for a divisor :
Clearly, is a vertex of too. From this it follows immediately that . Order the set of the positive divisors of as
where . Then it is again an easy exercise to show that the facets of are defined by the following supporting hyperplanes:
Hence, the lattice distances are , , and for , that is, they divide . □
Following Lemma 3.2 and the general ideas in Haase-Melnikov, the final step is to find for a choice of a base polytope with least common multiple of facet lattice distances a unit partition
where is as small as possible. This is a highly non-trivial number-theoretic problem for which ChatGPT originally uses the recent OpenAI solution of Erdős’s conjecture on short Egyptian fractions [28]. Recently, a very nice simplified and humanly written paper on this topic was uploaded on Hexagon by Thomas Bloom and Wouter van Doorn [7].
Theorem 4.2 ([7 Theorem 1 and Section 5]). For every , there exists an integer such that, for every integer and every integer , there exist and integers satisfying
Here, denotes the natural logarithm. By choosing, for example, , we get:
Corollary 4.3. There exists an integer such that for every integer there exist an integer and integers satisfying
Proof. Apply Theorem 4.2 with and where and then add on both sides of the unit partition equation. □
Remark 4.4. The authors know that the constant in Corollary 4.3 is not optimal. Indeed, the authors have an argument where they can improve it to . However, for proving the doubly exponential growth of the vertices this constant is irrelevant.
Theorem 4.5. Let and set . Then for every sufficiently large integer , depending on , there exist reflexive polytopes of dimension whose number of facets is at least
Proof. Let be the sufficiently large target dimension of the polytope in the statement. Fix and set
Let be the product of all prime numbers at most . Set . By Corollary 4.3, for (and thus and ) sufficiently large there exist integers satisfying
By Lemma 3.1, there is a reflexive simplex with vertices such that
By Lemma 4.1, the lattice distance of each facet of from the origin divides . Hence, this is also true for the lattice polytope which we define as the free sum of copies of . Therefore, by Lemma 3.2, the convex hull of
is a -dimensional reflexive polytope.
Let us convince ourselves that for sufficiently large. To that end, let us recall the following elementary version of the prime number theorem [1 Theorem 4.6] which holds for any integer :
where denotes the prime-counting function, i.e., the number of primes that are less than or equal to . This implies that
Hence,
Putting everything together we get
for again sufficiently large which shows the claim.
As , we can take the free sum of with an appropriate number of copies of the reflexive interval to obtain a reflexive polytope of dimension exactly . By Lemmas 3.2 and 4.1, has at least facets. All that remains is to bound this number from below in terms of . Clearly , so that
where the last inequality follows again from (1). It is straightforward to verify that
Substituting this into Equation (2), we get
where in the second to last inequality we used . This finishes the proof. □
We will add a more explicit bound in a later version.
Note that this result is rather stunning as it shows that the maximal number of facets and thus of vertices of reflexive -polytopes grows doubly exponential in . And this is essentially optimal as the number of lattice points is easily bounded3 in terms of the volume for which a sharp doubly exponential upper bound was proven in [2]. Previously, it was only known that the number of lattice points of reflexive polytopes can grow doubly exponential in the dimension. However, the previously known reflexive polytopes with this behaviour were just reflexive simplices, namely the Zaks-Perles-Wills simplices [29], also called Sylvester simplices [11].
Acknowledgments and AI declaration
The example, the lemmata and the general result were found in middle of October 2026 using GPT-6.1 Sol based upon prompts with ideas by the first author originally aimed at proving rather than disproving Conjecture 1.1. This paper was humanly written based upon the ChatGPT output.
When writing up this note, it was noticed that this problem was listed as Problem 610 in the internet repository [10] and a solution had already been posted by Kaiwen Jin just a few days after we had found our first 14-dimensional counterexample. Jin’s very nice counterexample is 45-dimensional [20] and its polar consists of cutting such that all facet lattice distances from the origin divide 32 and then adding 5-times pyramids of height 2 (which corresponds in Lemma 3.2 to with ). It does not seem to give rise to doubly exponential behaviour though.
This work is funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 539867500 as part of the research priority program Combinatorial Synergies.
List of vertices of and
(J. Hofscheier) School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, UK
Email address: [email protected]
(B. Nill) Faculty of Mathematics, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany
Email address: [email protected]
References
- [1]Tom M. Apostol. Introduction to analytic number theory. Undergraduate Texts in Mathematics. Springer-Verlag, New York-Heidelberg, January 1976.
- [2]Gabriele Balletti, Alexander M. Kasprzyk, and Benjamin Nill. On the maximum dual volume of a canonical Fano polytope. Forum of Mathematics, Sigma, 10:e109, 2022.arxiv.org/abs/1611.02455
- [3]Victor Batyrev and Benjamin Nill. Combinatorial aspects of mirror symmetry. In Integer points in polyhedra—geometry, number theory, representation theory, algebra, optimization, statistics, volume 452 of Contemp. Math., pages 35–66. Amer. Math. Soc., Providence, RI, 2008.arxiv.org/abs/math/0703456
- [4]Victor V. Batyrev. Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties. J. Algebra. Geom., 3(3):493–535, 1994.arxiv.org/abs/alg-geom/9310003
- [5]Matthias Beck, Pallavi Jayawant, and Tyrrell B. McAllister. Lattice-point generating functions for free sums of convex sets. Journal of Combinatorial Theory, Series A, 120(6):1246–1262, 2013.arxiv.org/abs/1207.0164
- [6]Matthias Beck, Benjamin Nill, Bruce Reznick, Carla Savage, Ivan Soprunov, and Zhiqiang Xu. Let me tell you my favorite lattice-point problem . . . In Integer points in polyhedra—geometry, number theory, representation theory, algebra, optimization, statistics, volume 452 of Contemp. Math., pages 179–187. Amer. Math. Soc., Providence, RI, 2008.DOI
- [7]Thomas Bloom and Wouter van Doorn. Optimal bounds for the length and number of unit fraction representations. Hexagon preprint, 2026. hexagon:2610.00407v1.
- [8]Benjamin Braun. An Ehrhart series formula for reflexive polytopes. The Electronic Journal of Combinatorics, 13(1):N15, 2006.DOI
- [9]Benjamin Braun and Robert Davis. Ehrhart series, unimodality, and integrally closed reflexive polytopes. Annals of Combinatorics, 20(4):705–717, 2016.arxiv.org/abs/1403.5378
- [10]Steve Brunton, Matthew J. Colbrook, Maarten V. de Hoop, George Stepaniants, Alex Townsend, and Rachel Ward. Nill’s facet bound for reflexive lattice polytopes. AIM—Open Applied Problems, Problem 610, GitHub, 2026. Last checked October 15, 2026. Accessed October 29, 2026.
- [11]Jhon B. Caicedo, Federico Castillo, Martina Juhnke, and Germain Poullot. Sylvester simplices: Triangulations and Ehrhart-theoretic aspects. arXiv preprint, 2026. arXiv:2609.23710.arxiv.org/abs/2609.23710
- [12]Cinzia Casagrande. The number of vertices of a Fano polytope. Annales de l’Institut Fourier, 56(1):121–130, 2006.DOI
- [13]Giulia Codenotti and Francisco Santos. Hollow polytopes of large width. Proceedings of the American Mathematical Society, 148(2):835–850, 2020.DOI
- [14]Heinke Conrads. Weighted projective spaces and reflexive simplices. Manuscripta Mathematica, 107(2):215–227, 2002.DOI
- [15]Luis Ferroni. Unimodality shenanigans in Ehrhart theory. arXiv preprint, 2026. arXiv:2609.10513.arxiv.org/abs/2609.10513
- [16]Christian Haase and Ilarion V. Melnikov. The reflexive dimension of a lattice polytope. Annals of Combinatorics, 10(2):211–217, 2006.DOI
- [17]Christian Haase, Andreas Paffenholz, Lindsay C. Piechnik, and Francisco Santos. Existence of unimodular triangulations - positive results. Memoirs of the American Mathematical Society, 270(1321), March 2021. arXiv:1405.1687.
- [18]Douglas Hensley. Lattice vertex polytopes with interior lattice points. Pac. J. Math., 105:183–191, 1983.DOI
- [19]Takayuki Hibi. A lower bound theorem for Ehrhart polynomials of convex polytopes. Advances in Mathematics, 105(2):162–165, 1994.
- [20]Kaiwen Jin. A counterexample to the facet bound for reflexive polytopes. Unpublished manuscript, GitHub revision b8c005e, October 14, 2026.
- [21]Maximilian Kreuzer and Harald Skarke. Complete classification of reflexive polyhedra in four dimensions. Adv. Theor. Math. Phys., 4(6):1209–1230, 2000.
- [22]Jeffrey C. Lagarias and Günter M. Ziegler. Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Can. J. Math., 43(5):1022–1035, 1991.DOI
- [23]Aki Mori, Kenta Mori, and Hidefumi Ohsugi. Number of facets of symmetric edge polytopes arising from join graphs. European Journal of Combinatorics, 127:104165, 2025.arxiv.org/abs/2312.11287
- [24]Aki Mori, Kenta Mori, and Hidefumi Ohsugi. Facet numbers of non-centrally symmetric reflexive polytopes arising from posets. Discrete & Computational Geometry, 2026.arxiv.org/abs/2511.22981
- [25]Benjamin Nill. Gorenstein toric Fano varieties. Manuscripta Mathematica, 116(2):183–210, 2005.DOI
- [26]Benjamin Nill. Classification of pseudo-symmetric simplicial reflexive polytopes. In Algebraic and Geometric Combinatorics, volume 423 of Contemporary Mathematics, pages 269–282. American Mathematical Society, Providence, RI, 2006.arxiv.org/abs/math/0511294
- [27]Benjamin Nill. Volume and lattice points of reflexive simplices. Discrete & Computational Geometry, 37(2):301–320, 2007.
- [28]OpenAI. Short Egyptian fractions. OpenAI Math Release preprint, September 2026. OAI:Short-Egyptian-fractions-September-25-2026.hub.valency.io/works/W_83ugjxhd
- [29]Joseph Zaks, Micha A. Perles, and Jörg M. Wills. On lattice polytopes having interior lattice points. Elemente der Mathematik, 37(2):44–46, 1982.
