Search arXivSearch

arXiv · 1905.13109

Non-linear additive twist of Fourier coefficients of $GL(3) \times GL(2)$ and $GL(3)$ Maass forms

Abstract

Let $λ_π(m,n)$ be the Fourier coefficients of a Hecke-Maass cusp form $π$ for $SL(3,\mathbb{Z})$ and $λ_{f}(n)$ be the Fourier coefficients of Hecke-eigen form $f$ for $SL(2,\mathbb{Z})$. The aim of this article is to get a non-trivial bound on the sum which is non-linear additive twist of the coefficients $λ_π(m,n)$ and $λ_{f}(n)$. More precisely, for any $0 < β< 1$ and $ε>0$, we have $$\sum_{n=1}^{\infty} λ_π(r,n) \, e\left(αn^β\right) V\left(\frac{n}{X}\right) \ll_{π,ε} α\sqrtβr^{\frac{7}{6}}X^{\frac{3}{4}+\frac{9β}{28}+ ε}.$$ and $$\sum_{n=1}^{\infty} λ_π(r,n) \, λ_{f}(n) \, e\left(αn^β\right) V\left(\frac{n}{X}\right) \ll_{π, f,ε} (αβ)^{\frac{3}{2}} rX^{\frac{3}{4}+\frac{29β}{44}+ε},$$ where $V(x)$ is a smooth function supported in $[1,2]$ and satisfying $V^{(j)}(x) \ll_{j} 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sumit Kumar, Kummari Mallesham, Saurabh Kumar Singh. 2021-10-13. Non-linear additive twist of Fourier coefficients of $GL(3) \times GL(2)$ and $GL(3)$ Maass forms. https://arxiv.org/abs/1905.13109

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