2020
DOI: 10.1007/s00208-020-02108-z
|View full text |Cite
|
Sign up to set email alerts
|

Exponential sums with multiplicative coefficients without the Ramanujan conjecture

Abstract: We study the exponential sum involving multiplicative function f under milder conditions on the range of f , which generalizes the work of Montgomery and Vaughan. As an application, we prove cancellation in the sum of additively twisted coefficients of automorphic L-function on GL m (m 4), uniformly in the additive character.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 39 publications
0
16
0
Order By: Relevance
“…for Re s > 1. By the Rankin-Selberg theory and the inequality |λ π (n)| 2 ≤ λ π×π (n) for all positive integers n (see [21,Lemma 3.1]), one has…”
Section: Applicationsmentioning
confidence: 99%
“…for Re s > 1. By the Rankin-Selberg theory and the inequality |λ π (n)| 2 ≤ λ π×π (n) for all positive integers n (see [21,Lemma 3.1]), one has…”
Section: Applicationsmentioning
confidence: 99%
“…In order to apply our theorem 1.1 to the sums (2.1) and (2.2), we need to verify these two hypotheses. By the Rankin-Selberg theory and the inequality |λ π (n)| 2 ≤ λ π×π (n) for all positive integers n (see [16,Lemma 3.1]), one has…”
Section: 1mentioning
confidence: 99%
“…Thus, when the function f retains reasonable decay in arithmetic progressions with modulus less than (logN)2+ε$(\log N)^{2+\varepsilon }$, we can expect that for any frequency αdouble-struckT$\alpha \in \mathbb {T}$, 1NnNf(n)Efalse[Nfalse]fefalse(nαfalse)(logN)1,$$\begin{align} \frac{1}{N}\sum _{n\leqslant N}{\left(f(n)-\mathbb {E}_{[N]}f \right)}e(n\alpha )\ll (\log N)^{-1}, \end{align}$$where we have written Efalse[Nfalse]f=Enfalse[Nfalse]f(n)=1NnNf(n)$\mathbb {E}_{[N]}f=\mathbb {E}_{n\in [N]}f(n)=\frac{1}{N}\sum _{n\leqslant N}f(n)$ as the average of f on the discrete interval false[Nfalse]=false{1,2,,Nfalse}$[N]=\lbrace 1,2,\dots ,N\rbrace$. Recently, Jiang, Lü, and Wang [19] weaken the above condition (1.1) that f takes bounded values in primes to the following two conditions pNfalse|f(p)false|2logpbadbreak≪N;$$\begin{equation} \sum _{p\leqslant N}|f(p)|^2\log p\ll N; \end{equation}$$and <...…”
Section: Introductionmentioning
confidence: 99%
“…Then the twisted 𝐿-function is defined by𝐿(𝑠, 𝜋 × 𝜒) = ∏When 𝑝 ∤ 𝑞, we have{ 𝛼 𝑗,𝜋×𝜒 (𝑝) ∶ 1 ⩽ 𝑗 ⩽ 𝑚 } = { 𝛼 𝑗,𝜋 (𝑝)𝜒(𝑝) ∶ 1 ⩽ 𝑗 ⩽ 𝑚 } . 𝑗,𝜋 (𝑝)𝜒(𝑝) 𝑝 𝑠) −𝐿(𝑠, 𝜋 × 𝜒) ∏We also need the following convexity bound for 𝐿(𝑠, 𝜋 × 𝜒), see[19, Lemma 3.2],…”
mentioning
confidence: 99%