Numerical verification of Littlewood's bounds for ∣L(1,χ)∣\vert L(1,χ)\vert

preprint2020arXivOpen access

Abstract

Let L(s,χ)L(s,χ) be the Dirichlet LL-function associated to a non trivial primitive Dirichlet character χχ defined  mod  q\bmod\ q, where qq is an odd prime. In this paper we introduce a fast method to compute ∣L(1,χ)∣\vert L(1,χ) \vert using the values of Euler's ΓΓ function. We also introduce an alternative way of computing log⁡Γ(x)\log Γ(x) and ψ(x)=Γ′/Γ(x)ψ(x)= Γ^\prime/Γ(x),x∈(0,1)x\in(0,1). Using such algorithms we numerically verify the classical Littlewood bounds and the recent Lamzouri-Li-Soundararajan estimates on ∣L(1,χ)∣\vert L(1,χ) \vert, where χχ runs over the non trivial primitive Dirichlet characters  mod  q\bmod\ q, for every odd prime qq up to 10710^7. The programs used and the results here described are collected at the following address \url{http://www.math.unipd.it/~languasc/Littlewood_ineq.html}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.