English

Gorenstein Simplices and Even Binary Self-Complementary Codes

Combinatorics 2026-04-29 v2 Algebraic Geometry

Abstract

It is known that if a Gorenstein simplex of dimension dd and degree ss is not a lattice pyramid, then d2s1d \leq 2s-1. In this paper, we study the extremal case d=2s1d=2s-1. More precisely, we characterize Gorenstein simplices of dimension 2s12s-1 and degree ss 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 33 and 44. Equivalently, we classify polarized dd-dimensional Gorenstein fake weighted projective spaces (X,L)(X,L) satisfying KX=(d2)L-K_X=(d-2)L or KX=(d3)L-K_X=(d-3)L, where KX-K_X is the anticanonical divisor of XX and LL is a Cartier divisor on XX.

Keywords

Cite

@article{arxiv.2604.15005,
  title  = {Gorenstein Simplices and Even Binary Self-Complementary Codes},
  author = {Akiyoshi Tsuchiya},
  journal= {arXiv preprint arXiv:2604.15005},
  year   = {2026}
}

Comments

19 pages

R2 v1 2026-07-01T12:12:39.264Z