Gorenstein Simplices and Even Binary Self-Complementary Codes

Abstract

It is known that if a Gorenstein simplex of dimension \(d\) and degree \(s\) is not a lattice pyramid, then \(d ≤ 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 -KX=(d-2)L or -KX=(d-3)L, where \(-KX\) is the anticanonical divisor of \(X\) and \(L\) is a Cartier divisor on \(X\).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…