Search arXiv⌕ Search

arXiv · 2610.15288

The Norm Spectrum of Barnes-Wall Lattices Below Twice the Minimum

Abstract

Let $Λ_m$ be the Barnes-Wall lattice of dimension $2^m$, normalized to have minimum squared norm $d_m:=2^{m-1}$. We determine its complete norm spectrum strictly between $d_m$ and $2d_m$, proving that, for every integer $m\ge1$, $\{\|x\|^2:x\inΛ_m,\ d_m<\|x\|^2<2d_m\}=\{2d_m-2^j:j\in\mathbb Z,\ \lceil m/2\rceil\le j\le m-2\}$. In particular, the norm spectrum in this interval is nonempty for $m\ge4$. The proof uses a Gaussian-integer model in which lattice automorphisms arising from Clifford unitaries transform a vector into a pair of coordinate subvectors in a lower-dimensional lattice. Divisibility of the differences of their squared norms and a matrix Parseval identity provide the arithmetic and averaging constraints needed for induction on $m$. Every listed norm is realized explicitly by a sum of two minimal vectors of the lattice.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuhang Cao, Sihuang Hu, Hexiang Huang, Mengrui Yang. 2026-10-11. The Norm Spectrum of Barnes-Wall Lattices Below Twice the Minimum. https://arxiv.org/abs/2610.15288

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

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗