Search arXivSearch

arXiv · 2607.08982

Joint level-weight murmurations: prime averaging and the cubic pointwise range

Abstract

Let (N) range over squarefree levels (N \asymp X), and let the even weight (k) vary in a smooth window (k \asymp K). We study natural root-number-weighted traces of Hecke eigenvalues at primes (p \asymp XK^2). First, uniformly for (X^{\varepsilon_0} \leq K \leq X^{3-\varepsilon_0}), we prove a fixed-prime asymptotic whose main term is expressed through Zubrilina's murmuration density. The exponent (3) is the endpoint of our absolute treatment of the nonzero Poisson frequencies. Second, after averaging the primes with logarithmic weight, we obtain unconditionally, throughout every fixed polynomial range (X^{\varepsilon_0} \leq K \leq X^{A_0}), an explicit atomic limiting measure. The fixed-prime argument groups the local Fourier expansion by exact additive conductor and uses Burgess truncation, whereas the prime-averaged argument applies a smooth Barban-Davenport-Halberstam estimate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Julien Cardi. 2026-07-24. Joint level-weight murmurations: prime averaging and the cubic pointwise range. https://arxiv.org/abs/2607.08982

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