2017
DOI: 10.48550/arxiv.1709.05615
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Subconvexity for symmetric square $L$-functions

Abstract: Let f be a holomorphic modular form of prime level p and trivial nebentypus. We show that there exists a computable δ > 0, such that L 1 2 , Sym 2 f ≪ p 1 2 −δ , with the implied constant depending only on δ and the weight of f .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 13 publications
0
8
0
Order By: Relevance
“…In the diagonal-terms r 1 t 2 = r 2 t 1 , we save |L|C 2 which is greater than C 2 . For the off diagonal terms we note that the shift pq(r 1 t 2 − r 2 t 1 ) (defined in (6.3)) is a multiple of p. Munshi [29] encounters a similar problem of bounding…”
Section: Outline Of Proofmentioning
confidence: 99%
See 3 more Smart Citations
“…In the diagonal-terms r 1 t 2 = r 2 t 1 , we save |L|C 2 which is greater than C 2 . For the off diagonal terms we note that the shift pq(r 1 t 2 − r 2 t 1 ) (defined in (6.3)) is a multiple of p. Munshi [29] encounters a similar problem of bounding…”
Section: Outline Of Proofmentioning
confidence: 99%
“…We use the version due to Heath-Brown in [10]. The following Lemma is from Munshi's paper [29,Lemma 23]. In this section we shall use the letter q to denote the moduli in the circle method.…”
Section: Shifted Convolution Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…Another approach to the GL 3 subconvexity problem is the circle method technique elaborated in the series 'The circle method and bounds for L-functions I-IV' of Munshi [Mun1]- [Mun4]. His method was further developed and simplified in [Mun5], [Mun6], [HN], [Lin] and [SZ]. Moreover, as an application of the GL 3 Kuznetsov formula in [But], Blomer and Buttcane [BB2,BB3] successfully solved the subconvexity problem in the aspect of the GL 3 Archimedean Langlands parameter (the µ-aspect).…”
Section: Introductionmentioning
confidence: 99%