arxiv: 2604.15005 · v2 · submitted 2026-04-16 · 🧮 math.CO · math.AG

Recognition: unknown

Gorenstein Simplices and Even Binary Self-Complementary Codes

Akiyoshi Tsuchiya

Authors on Pith no claims yet

Pith reviewed 2026-05-10 10:59 UTC · model grok-4.3

classification 🧮 math.CO math.AG

keywords Gorenstein simpliceseven binary self-complementary codeslattice pyramidsreflexive simplicesfake weighted projective spacesanticanonical divisorslattice polytopes

0 comments

The pith

Gorenstein simplices of dimension 2s-1 and degree s that are not lattice pyramids correspond to even binary self-complementary codes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a direct characterization of non-pyramid Gorenstein simplices in the extremal case of dimension 2s-1 and degree s using even binary self-complementary codes. This link is applied to produce explicit classifications for degrees 3 and 4 by drawing on earlier enumerations of reflexive simplices. The same results give complete lists of polarized d-dimensional Gorenstein fake weighted projective spaces satisfying -K_X = (d-2)L or -K_X = (d-3)L. A reader would care because the correspondence turns a geometric classification problem into a combinatorial one that can be checked against known code tables.

Core claim

Gorenstein simplices of dimension 2s-1 and degree s which are not lattice pyramids are characterized in terms of even binary self-complementary codes. Combining this characterization with existing classification results on reflexive simplices yields explicit lists for degrees 3 and 4. Equivalently, the work classifies polarized d-dimensional Gorenstein fake weighted projective spaces (X, L) satisfying -K_X = (d-2)L or -K_X = (d-3)L.

What carries the argument

The one-to-one correspondence that associates each non-pyramid Gorenstein simplex of dimension 2s-1 and degree s with an even binary self-complementary code.

If this is right

All non-pyramid Gorenstein simplices of degree 3 are listed explicitly.
All non-pyramid Gorenstein simplices of degree 4 are listed explicitly.
The corresponding polarized Gorenstein fake weighted projective spaces are classified for the two anticanonical conditions when the degree is 3 or 4.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

If fuller tables of even binary self-complementary codes become available, the same correspondence could produce classifications for higher degrees.
The coding-theoretic description may suggest constructions of new Gorenstein simplices by starting from known families of self-complementary codes.
Analogous correspondences could be sought for Gorenstein polytopes that are not simplices or for other classes of lattice polytopes.

Load-bearing premise

The known bound d ≤ 2s-1 holds for any non-pyramid Gorenstein simplex, and the prior classifications of reflexive simplices used for degrees 3 and 4 are complete.

What would settle it

A Gorenstein simplex of dimension 2s-1 and degree s that cannot be matched to any even binary self-complementary code, or a missing simplex in the explicit lists produced for degree 3 or 4.

read the original abstract

It is known that if a Gorenstein simplex of dimension $d$ and degree $s$ is not a lattice pyramid, then $d \leq 2s-1$. In this paper, we study the extremal case $d=2s-1$. More precisely, we characterize Gorenstein simplices of dimension $2s-1$ and degree $s$ which are not lattice pyramids in terms of even binary self-complementary codes. As an application, combining this characterization with existing classification results on reflexive simplices, we classify Gorenstein simplices of degree $3$ and $4$. Equivalently, we classify polarized $d$-dimensional Gorenstein fake weighted projective spaces $(X,L)$ satisfying $-K_X=(d-2)L$ or $-K_X=(d-3)L$, where $-K_X$ is the anticanonical divisor of $X$ and $L$ is a Cartier divisor on $X$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper links non-pyramid Gorenstein simplices of dimension 2s-1 and degree s to even binary self-complementary codes and classifies the s=3 and s=4 cases by pulling in prior reflexive simplex lists.

read the letter

The key takeaway is a new characterization that ties non-pyramid Gorenstein simplices of dimension 2s-1 and degree s directly to even binary self-complementary codes, plus concrete classifications for degrees 3 and 4. The paper does a solid job laying out the correspondence and showing how it works with the known bound on dimension. The application to low degrees gives explicit results by combining the new bijection with prior reflexive simplex work. One soft spot is that the completeness of the degree 3 and 4 lists depends on the prior classifications of reflexive simplices being exhaustive; the paper treats those as given without additional verification. That's not a flaw in the new part, but it means the final lists inherit whatever limitations the earlier papers had. The math on the code side appears self-contained. This paper is for combinatorial algebraic geometers working on Gorenstein polytopes or related toric varieties. Specialists in that niche will find the code connection useful for further enumeration or properties. It deserves a serious referee because the central characterization is new and the application is a direct consequence, even if it builds on existing lists.

Referee Report

2 major / 2 minor

Summary. The paper claims that non-lattice-pyramid Gorenstein simplices of dimension 2s-1 and degree s are characterized by even binary self-complementary codes. It applies this bijection together with prior classifications of reflexive simplices to enumerate all such simplices for s=3 (dimension 5) and s=4 (dimension 7), and equivalently classifies the corresponding polarized Gorenstein fake weighted projective spaces satisfying -K_X = (d-2)L or -K_X = (d-3)L.

Significance. If the characterization is correct, the result supplies a concrete combinatorial dictionary between extremal Gorenstein simplices and a well-studied class of binary codes, which may enable further enumerations and links between toric geometry and coding theory. The explicit lists for degrees 3 and 4 constitute a tangible classification result.

major comments (2)

[Application section (classification for degrees 3 and 4)] The central claim equates non-pyramid Gorenstein simplices of dimension 2s-1 and degree s with even binary self-complementary codes, but the manuscript does not re-derive or verify the completeness of the cited reflexive-simplex classifications used for the s=3 and s=4 cases; any gap in those external lists would render the claimed enumerations incomplete.
[Introduction / background paragraph] The known bound d ≤ 2s-1 for non-pyramid Gorenstein simplices is invoked as background to justify focusing on the extremal case, yet the paper does not supply a self-contained reference or short proof sketch for this inequality, which is load-bearing for restricting attention to dimension 2s-1.

minor comments (2)

[Abstract and §1] Notation for the codes (even, binary, self-complementary) should be defined explicitly at first use rather than assumed from the title.
[Abstract] The equivalence statement relating the simplices to polarized fake weighted projective spaces would benefit from a one-sentence reminder of the correspondence between Gorenstein simplices and such spaces.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed report and constructive suggestions. We address the two major comments below, indicating planned revisions where appropriate. Our responses focus on strengthening the manuscript without altering its core results.

read point-by-point responses

Referee: [Application section (classification for degrees 3 and 4)] The central claim equates non-pyramid Gorenstein simplices of dimension 2s-1 and degree s with even binary self-complementary codes, but the manuscript does not re-derive or verify the completeness of the cited reflexive-simplex classifications used for the s=3 and s=4 cases; any gap in those external lists would render the claimed enumerations incomplete.

Authors: We agree that the enumerations for degrees 3 and 4 are only as complete as the cited classifications of reflexive simplices. The new contribution of the paper is the bijection with even binary self-complementary codes; the lists for s=3,4 are obtained by applying this bijection to the known reflexive cases. In the revision we will (i) add explicit citations to the precise sources of the reflexive classifications (including page or theorem numbers), and (ii) insert a short clarifying sentence stating that the resulting lists are complete relative to those prior enumerations. We do not re-derive the reflexive lists, as they are established results in the literature and outside the scope of the present work. revision: partial
Referee: [Introduction / background paragraph] The known bound d ≤ 2s-1 for non-pyramid Gorenstein simplices is invoked as background to justify focusing on the extremal case, yet the paper does not supply a self-contained reference or short proof sketch for this inequality, which is load-bearing for restricting attention to dimension 2s-1.

Authors: The referee is correct that the bound is invoked without a direct reference or sketch. This inequality appears in the literature on Gorenstein polytopes and reflexive simplices. In the revised manuscript we will add an explicit citation to the source establishing d ≤ 2s-1 for non-pyramid Gorenstein simplices and, space permitting, include a one-sentence outline of the argument (based on the relation between the degree and the lattice width). revision: yes

Circularity Check

0 steps flagged

Characterization via codes is independent; low-degree classification applies external reflexive simplex lists

full rationale

The central result is a characterization equating non-lattice-pyramid Gorenstein simplices of dimension 2s-1 and degree s with even binary self-complementary codes. This equivalence is presented as a theorem derived from the combinatorial and algebraic definitions of the objects involved, together with the background inequality d ≤ 2s-1. No step in the provided derivation reduces the claimed result to a fitted parameter, a self-referential definition, or a load-bearing self-citation whose content is itself unverified. The application to degrees 3 and 4 simply invokes the new bijection on top of pre-existing external classifications of reflexive simplices; those prior lists are treated as independent inputs and are not reproduced or justified inside the paper. Because the core equivalence stands on its own mathematical content and the classification step does not feed back into the characterization, the derivation chain contains no circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper rests on the standard definition of Gorenstein simplices, the known bound d ≤ 2s-1 for non-pyramids, and prior complete lists of reflexive simplices; no new free parameters or invented entities are introduced.

axioms (2)

domain assumption Any Gorenstein simplex of dimension d and degree s that is not a lattice pyramid satisfies d ≤ 2s-1
Cited as known from earlier work; used to define the extremal case studied here.
domain assumption The prior classification of reflexive simplices is complete and can be combined with the new characterization
Invoked explicitly for the application to degrees 3 and 4.

pith-pipeline@v0.9.0 · 5465 in / 1307 out tokens · 41391 ms · 2026-05-10T10:59:21.650896+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$
math.CO 2026-05 unverdicted novelty 6.0

Gorenstein simplices with the given h*-polynomial are classified up to unimodular equivalence by strict divisor chains in the divisor lattice of v, yielding an explicit counting formula.

Reference graph

Works this paper leans on

17 extracted references · 2 canonical work pages · cited by 1 Pith paper

[1]

Classification of Gorenstein toric del Pezzo varieties in arbitrary dimension

Victor Batyrev and Dorothee Juny. Classification of Gorenstein toric del Pezzo varieties in arbitrary dimension. Mosc. Math. J., 10(2):285–316, 478, 2010

2010
[2]

Batyrev and Johannes Hofscheier , Title =

Victor V . Batyrev and Johannes Hofscheier. Lattice polytopes, finite abelian subgroups in sl(n,C)and coding theory, 2013, arXiv:1309.5312

work page arXiv 2013
[3]

Undergraduate Texts in Mathematics

Matthias Beck and Sinai 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

2015
[4]

Gorenstein algebras of Veronese type.J

Emanuela De Negri and Takayuki Hibi. Gorenstein algebras of Veronese type.J. Algebra, 193(2):629–639, 1997

1997
[5]

Polyhedral adjunction theory.Alge- bra Number Theory, 7(10):2417–2446, 2013

Sandra Di Rocco, Christian Haase, Benjamin Nill, and Andreas Paffenholz. Polyhedral adjunction theory.Alge- bra Number Theory, 7(10):2417–2446, 2013

2013
[6]

Sur les poly`edres rationnels homoth´etiques `andimensions.C

Eug `ene Ehrhart. Sur les poly`edres rationnels homoth´etiques `andimensions.C. R. Acad. Sci. Paris, 254:616–618, 1962

1962
[7]

2025, arXiv:2510.09131 , Eprint =

Marco Ghirlanda. A classification algorithm for reflexive simplices, 2025, arXiv:2510.09131

work page arXiv 2025
[8]

Reflexive simplices up to dimension six, Zenodo, 2025

Marco Ghirlanda. Reflexive simplices up to dimension six, Zenodo, 2025

2025
[9]

Gorenstein simplices with a givenδ-polynomial

Takayuki Hibi, Akiyoshi Tsuchiya, and Koutarou Yoshida. Gorenstein simplices with a givenδ-polynomial. Discrete Math., 342(12):111619, 10, 2019

2019
[10]

Lattice simplices of maximal dimension with a given degree.Michigan Math

Akihiro Higashitani. Lattice simplices of maximal dimension with a given degree.Michigan Math. J., 68(1):193– 210, 2019

2019
[11]

Gorenstein polytopes with trinomialh ∗- polynomials.Beitr

Akihiro Higashitani, Benjamin Nill, and Akiyoshi Tsuchiya. Gorenstein polytopes with trinomialh ∗- polynomials.Beitr. Algebra Geom., 62(3):667–685, 2021

2021
[12]

Classification of reflexive polyhedra in three dimensions.Adv

Maximilian Kreuzer and Harald Skarke. Classification of reflexive polyhedra in three dimensions.Adv. Theor. Math. Phys., 2(4):853–871, 1998

1998
[13]

Complete classification of reflexive polyhedra in four dimensions.Adv

Maximilian Kreuzer and Harald Skarke. Complete classification of reflexive polyhedra in four dimensions.Adv. Theor. Math. Phys., 4(6):1209–1230, 2000

2000
[14]

Lattice polytopes havingh ∗-polynomials with given degree and linear coefficient.European J

Benjamin Nill. Lattice polytopes havingh ∗-polynomials with given degree and linear coefficient.European J. Combin., 29(7):1596–1602, 2008

2008
[15]

Proof of a conjecture of Batyrev and Juny on Gorenstein polytopes.Discrete Comput

Benjamin Nill. Proof of a conjecture of Batyrev and Juny on Gorenstein polytopes.Discrete Comput. Geom., 72(4):1519–1529, 2024

2024
[16]

Richard P. Stanley. Decompositions of rational convex polytopes.Ann. Discrete Math., 6:333–342, 1980

1980
[17]

Gorenstein simplices and the associated finite abelian groups.European J

Akiyoshi Tsuchiya. Gorenstein simplices and the associated finite abelian groups.European J. Combin., 67:145– 157, 2018. AKIYOSHITSUCHIYA, DEPARTMENT OFINFORMATIONSCIENCE, FACULTY OFSCIENCE, TOHOUNIVERSITY, 2-2-1 MIYAMA, FUNABASHI, CHIBA274-8510, JAPAN Email address:akiyoshi@is.sci.toho-u.ac.jp 19

2018