Equality in a Reverse Minkowski Shell Bound for Integral Lattices via Spherical Designs
For researchers in discrete geometry and lattice theory, this resolves the extremal cases of a fundamental shell bound, showing that equality is highly rigid.
This paper classifies all equality cases of a known upper bound on the number of lattice vectors of a given norm. For n≥2, equality occurs only for the integer lattice Z^n with norm 1 or the E8 lattice with norm 2; for n=1, equality holds whenever the lattice represents the norm.
For a full-rank integral lattice $\mathcal{L}\subset\mathbb{R}^n$, Regev and Stephens-Davidowitz proved that \[N_{=k}(\mathcal{L}):=|\{y\in\mathcal{L}:\lVert y\rVert^2=k\}|\le 2\binom{n+2k-2}{2k-1}.\] We classify the equality cases. For $n\ge2$, equality holds if and only if either $k=1$ and $\mathcal{L}\cong\mathbb{Z}^n$, or $n=8$, $k=2$, and $\mathcal{L}\cong E_8$. For $n=1$, equality holds exactly when $\mathcal{L}$ represents $k$. The proof shows that equality is rigid. Saturation of the shell bound forces the normalized norm-$k$ shell to be an antipodal tight spherical $(4k-1)$-design. The associated Delsarte--Goethals--Seidel annihilator polynomial gives an arithmetic root condition, which isolates $E_8$ at $k=2$, rules out $k=3$, and combines with the Bannai--Damerell/Bannai theorem and an elementary circle argument to exclude all remaining cases in dimension at least $2$.