Decomposing Gorenstein polytopes of large index

Abstract

In this paper we prove a free-join decomposition theorem on Gorenstein polytopes significantly improving upon results in prior joint work of the second author with Batyrev, Borger, Haase, Kretschmer, and Payne. In particular, as a strong extension of the Batyrev-Juny lattice pyramid theorem it implies that any d-dimensional Gorenstein polytope P of index larger than (d+2)/2 is a free join of Gorenstein polytopes. Here, the index (also called codegree) is the dilation factor r such that rP is reflexive. As our main application, we prove that the stringy E-polynomial of a Gorenstein polytope P vanishes if and only if P is thin (i.e., its local h^*-polynomial vanishes), and it has the expected degree otherwise. The latter was conjectured by Batyrev and the second author. The proofs of the general results were found via ChatGPT 5.6 Sol, while a proof of the extremal case of the Batyrev-Juny conjecture is contained in the master thesis of the first author.

GORENSTEIN FANO POLYTOPES ARISING FROM ORDER POLYTOPES AND CHAIN POLYTOPES
Takayuki Hibi, Kazunori Matsuda, Akiyoshi Tsuchiya
Journal of Commutative Algebra29 Jul 2026Peer-reviewedLicence not statedFull text13 citedCombinatorics & discrete mathematicsOpenAlex
Bounded powers of edge ideals: Nearly Gorenstein polytopes
Takayuki Hibi, Seyed Amin Seyed Fakhari
arXiv17 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
Gaussian polytopes with large Banach-Mazur distance to the cross-polytope
Antonios Hmadi
arXiv24 Sep 2026PreprintCC BY-NC-SA 4.0Full textAnalysis & PDEs Geometry & topologyarXiv
Calabi–Yau varieties of large index
Louis Esser, Burt Totaro, Chengxi Wang
Algebraic geometry21 Aug 2026Peer-reviewedCC BYFull text14 citedGeometry & topologyOpenAlex
Large and Moderate Deviations for Conservative Tail-Index Estimation
Martijn Gösgens, Bart P. G. van Parys, Bert Zwart
arXiv25 Sep 2026PreprintCC BY 4.0Full textProbability StatisticsarXiv

Cite

BibTeX RIS

BibTeX

@misc{knupfer2026decomposing,
  title = {{Decomposing Gorenstein polytopes of large index}},
  author = {Johannes Knupfer and Benjamin Nill},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.18873},
  eprint = {2609.18873},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.18873},
}

RIS

TY  - UNPB
TI  - Decomposing Gorenstein polytopes of large index
AU  - Johannes Knupfer
AU  - Benjamin Nill
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2609.18873
UR  - https://arxiv.org/abs/2609.18873
AB  - In this paper we prove a free-join decomposition theorem on Gorenstein polytopes significantly improving upon results in prior joint work of the second author with Batyrev, Borger, Haase, Kretschmer, and Payne. In particular, as a strong extension of the Batyrev-Juny lattice pyramid theorem it implies that any d-dimensional Gorenstein polytope P of index larger than (d+2)/2 is a free join of Gorenstein polytopes. Here, the index (also called codegree) is the dilation factor r such that rP is reflexive. As our main application, we prove that the stringy E-polynomial of a Gorenstein polytope P vanishes if and only if P is thin (i.e., its local h^*-polynomial vanishes), and it has the expected degree otherwise. The latter was conjectured by Batyrev and the second author. The proofs of the general results were found via ChatGPT 5.6 Sol, while a proof of the extremal case of the Batyrev-Juny conjecture is contained in the master thesis of the first author.
ER  -

Abstract

Related

Cite