Search arXiv⌕ Search

arXiv · 2610.26125

Unimodular defect and antipodal lattice points of smooth reflexive polytopes

Abstract

Let $P$ be a smooth reflexive polytope and let $Q=P^{*}$ be the dual of smooth Fano polytope. Ewald's conjecture (1988) predicts that the lattice points of $P\cap (-P)$ contain a lattice basis. In general it is not even known whether $P\cap (-P)$ contains a nonzero lattice point; we call this weakest form of the conjecture the antipodal condition. We define the unimodular defect of a finite set of lattice vectors as the least number of vectors that must be removed to leave a unimodular set, and the unimodular defect of $Q$ as that of its vertex set. Defect zero gives the unimodular smooth Fano polytopes, for which Ewald's conjecture is known. Our main result is that every smooth Fano polytope of unimodular defect at most two has a \emph{flat ridge}, a ridge $W$ with $|\det(v,W)|\leq 1$ for all vertices $v$; consequently its dual satisfies the antipodal condition. We also consider removed sets of pairwise non-adjacent vertices. Using results of Nill on independent vertices, we show that every such set has at most two elements unless $Q$ is unimodular, so the antipodal condition holds whenever such a set exists.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Binnan Tu. 2026-10-19. Unimodular defect and antipodal lattice points of smooth reflexive polytopes. https://arxiv.org/abs/2610.26125

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

KEEP EXPLORING

Related papers

$2$-large sets are sets of nil-Bohr recurrence

A set $S$ of positive integers is $2$-large if every two-coloring contains arbitrarily long monochromatic arithmetic progressions with common difference in $S$. We prove that every such set meets every nil-Bohr neighborhood of $0$. This proves a conjecture of the first author and gives a sharp answer to a question of Host, Kra, and Maass. We also show that, for every fixed nil-Bohr neighborhood $B$ of $0$ and every $\varepsilon>0$, restricting the common difference to $B$ increases the extremal number for $k$-term arithmetic progressions by at most a factor of $1+\varepsilon$, provided $k$ is sufficiently large.

math.CO↗

Balanced subgraph counts and quasirandomness: a proof of the Janson--Sós conjecture

Let $F$ be a finite simple graph with $m$ vertices and at least two edges, and let $p\in(0,1]$. We prove that a graph sequence is $p$-quasirandom if and only if the symmetrized counts of copies of $F$ across every balanced partition into $m$ classes have the asymptotics predicted by the random graph with edge probability $p$. This settles a conjecture of Janson and Sós for all such $F$, including graphs with isolated vertices. The proof completes their graph-limit reduction by a concavity argument for a sum of fractional powers determined by the degree sequence of $F$. We also show that a symmetrized subgraph kernel of positive mean can be additive in its coordinates only when the underlying graphon is constant almost everywhere. This rigidity result yields a quasirandomness criterion for generalized restricted subgraph counts, resolving a further conjecture of Janson.

math.CO↗

On the Number of Iterations in a Kruskal-Type Process

Motivated by the Kruskal counting procedure, this paper investigates a combinatorial elimination process defined on a deck consisting of $m$ copies of each value $1,2,\ldots,n$. Starting from an arbitrary arrangement of the $mn$ cards, the process repeatedly removes a number of consecutive cards equal to the value of the first remaining card. This generates a sequence of elimination steps whose length determines $T$, representing the total number of iterations required to exhaust the deck. The main objective of this paper is to analyze an upper bound $σ(m,n)$ for $T$, valid for every initial configuration of the deck, and to show that this bound is attained by a specific configuration.

math.CO↗