Search arXivSearch

arXiv · 2402.07473

Moments of real Dirichlet $L$-functions and multiple Dirichlet series

Abstract

We consider the multiple Dirichlet series associated to the $k$th moment of real Dirichlet $L$-functions, and prove that it has a meromorphic continuation to a specific region in $\mathbb{C}^{k+1}$, which is conditional under the generalized Lindelöf hypothesis for $k\geq 5$. As a corollary, we obtain asymptotic formulas for the first three moments with a power-saving error term, and detect the 0- and 1-swap terms in related problems for any $k$ (conditionally under the Generalized Lindelöf Hypothesis), recovering the recent results of Conrey and Rodgers on long Dirichlet polynomials. The advantage of our method is its simplicity, since we don't need to modify the multiple Dirichlet series to obtain its meromorphic continuation. As a result, we obtain the asymptotic formulas directly in the form as they appear in the recipe predictions of Conrey, Farmer, Keating, Rubinstein and Snaith.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin Čech. 2026-08-07. Moments of real Dirichlet $L$-functions and multiple Dirichlet series. https://arxiv.org/abs/2402.07473

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