Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.15005

Gorenstein Simplices and Even Binary Self-Complementary Codes

Akiyoshi Tsuchiya
View original source ↗Read source document ↗Export metadata ↓

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\).

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akiyoshi Tsuchiya. 2026-04-26. Gorenstein Simplices and Even Binary Self-Complementary Codes. https://arxiv.org/abs/2604.15005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗