Search arXivSearch

arXiv · 1411.4467

On moments of twisted $L$-functions

Abstract

We study the average of the product of the central values of two $L$-functions of modular forms $f$ and $g$ twisted by Dirichlet characters to a large prime modulus $q$. As our principal tools, we use spectral theory to develop bounds on averages of shifted convolution sums with differences ranging over multiples of $q$, and we use the theory of Deligne and Katz to estimate certain complete exponential sums in several variables and prove new bounds on bilinear forms in Kloosterman sums with power savings when both variables are near the square root of $q$. When at least one of the forms $f$ and $g$ is non-cuspidal, we obtain an asymptotic formula for the mixed second moment of twisted $L$-functions with a power saving error term. In particular, when both are non-cuspidal, this gives a significant improvement on M.~Young's asymptotic evaluation of the fourth moment of Dirichlet $L$-functions. In the general case, the asymptotic formula with a power saving is proved under a conjectural estimate for certain bilinear forms in Kloosterman sums.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valentin Blomer, Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, Djordje Milićević. 2016-01-09. On moments of twisted $L$-functions. https://doi.org/10.1353/ajm.2017.0019

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