Search arXivSearch

arXiv · 2606.30618

Shifted convolution sums of coefficients of symmetric power $L$-functions with $k$-full kernels over sums of squares in arithmetic progressions

Abstract

Let $q$ be an integer and let $f$ be a normalised Hecke eigenform of integral weight for the full modular group. Let $L(s,\mathrm{sym}^j f)$ denote the $j$-th symmetric power $L$-function associated to $f$, and let $λ_{\mathrm{sym}^j f}(n)$ denote its $n$-th coefficient. We study the behaviour of the partial sum of $λ_{\mathrm{sym}^j f}(n)$, and of its second moment, taken over those sums of $m$ squares that are congruent to $1$ modulo $q$. As an application, we investigate the shifted convolution sum of $λ_{\mathrm{sym}^j f}(n)$ against a $k$-full kernel function, for any $k \geq 2$. We also study the number of sign changes of $λ_{\mathrm{sym}^j f}(n)$ twisted with a $k$-full kernel function, again over sums of $m$ squares. Throughout, $m$ is even with $m \in \{2,4,6,8,10,12\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jewel Mahajan, Arnab Mitra. 2026-06-29. Shifted convolution sums of coefficients of symmetric power $L$-functions with $k$-full kernels over sums of squares in arithmetic progressions. https://arxiv.org/abs/2606.30618

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