2000 character limit reached
The subconvexity problem for Rankin-Selberg and triple product L-functions (2207.14449v2)
Published 29 Jul 2022 in math.NT
Abstract: In this paper we study the subconvexity problem for the Rankin-Selberg L-function and triple product L-function, allowing joint ramifications and conductor dropping range. We first extend the method of Michel-Venkatesh to reduce the bounds for L-functions to local conjectures on test vectors, then verify these local conjectures under certain conditions, giving new subconvex bounds as long as the representations are not completely related.
Collections
Sign up for free to add this paper to one or more collections.