Search arXivSearch

arXiv · 2609.18873

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 $\frac{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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johannes Knupfer, Benjamin Nill. 2026-09-16. Decomposing Gorenstein polytopes of large index. https://arxiv.org/abs/2609.18873

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO