Search arXivSearch

arXiv · 2606.08733

On the degree-$2$ Siegel theta series of extremal even unimodular lattices of ranks $48$, $72$, $96$, and $120$

Abstract

We study degree-$2$ Siegel theta series of extremal even unimodular lattices from the genus-$2$ viewpoint initiated by Ozeki. Using Igusa's structure theorem, we define a depth filtration on genus-$2$ cusp forms, measured by the total degree in $χ_{10}$ and $χ_{12}$, and relate it to the vanishing of low Fourier--Jacobi coefficients forced by extremality. In ranks $48$, $72$, and $96$, this interaction closes exactly and yields a direct genus-$2$ proof that the degree-$2$ theta series is uniquely determined by extremality (conditional on existence in rank $96$). In rank $120$ (again conditional on existence), the same argument leaves a one-dimensional residual line spanned by $χ_{10}^6$: with $χ_{10}$ in the standard integral normalization, any two such degree-$2$ theta series differ by an integer multiple of $χ_{10}^6$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Scott Duke Kominers. 2026-06-07. On the degree-$2$ Siegel theta series of extremal even unimodular lattices of ranks $48$, $72$, $96$, and $120$. https://arxiv.org/abs/2606.08733

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT