2000 character limit reached
Sup-norm bounds for Eisenstein series
Published 12 Aug 2015 in math.NT | (1508.02799v3)
Abstract: The paper deals with establishing bounds for Eisenstein series on congruence quotients of the upper half plane, with control of both the spectral parameter and the level. The key observation in this work is that we exploit better the structure of the amplifier by just supporting on primes for the Eisenstein series, which can use both the analytic method as Young did to get a lower bound for the amplifier and the geometric method as Harcos--Templier did to obtain a more efficient treatment for the counting problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.