Abstract
We consider Dirichlet L-functions \(L(s, \chi )\) where \(\chi \) is a non-principal quadratic character to the modulus q. We make explicit a result due to Pintz and Stephens by showing that \(|L(1, \chi )|\leqslant \frac{1}{2}\log q\) for all \(q\geqslant 2\cdot 10^{23}\) and \(|L(1, \chi )|\leqslant \frac{9}{20}\log q\) for all \(q\geqslant 5\cdot 10^{50}\).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and results
A central problem in number theory concerns estimates on \(L(1, \chi )\), where \(\chi \) is a non-principal Dirichlet character to the modulus q, and where \(L(s, \chi )\) is its associated Dirichlet L-function. Bounding sums of \(\chi (n)\) trivially leads to the bound \(|L(1, \chi )| \leqslant \log q + O(1)\). The Pólya–Vinogradov inequality allows one to improve this to \((1/2)\log q + O(1)\). An interesting history of these developments is given by Pintz [28].
Explicit versions of the above results date back to Hua [10]. See also work by Louboutin [22] and the second author [32, 33] for finding small pairs \(c, q_{0}\) such that \(|L(1, \chi )|\leqslant (1/2) \log q + c\) for all \(q\geqslant q_{0}\). It appears difficult to improve on these bounds for generic q.
When q is prime, the best result is due to Stephens [37], namely that \(|L(1, \chi )|\leqslant \frac{1}{2}(1 - e^{-1/2} + o(1))\log q\), where \(\frac{1}{2}(1- e^{-1/2}) = 0.1967\ldots \). This result has been extended to arbitrary moduli by Pintz in [28, 29]. In this paper we focus on quadratic characters \(\chi \) for which it is known (see, e.g., §6 in [7]) that \(L(1, \chi )>0\). We aim at making the Pintz–Stephens result partially explicit in the following theorems.
Theorem 1
Let \(\chi \) be a quadratic odd primitive Dirichlet character modulo \(q\geqslant 2\cdot 10^{23}\). We have \(L(1,\chi )\leqslant (\log q)/2\).
For all even characters (not just quadratic ones) it is known that \(|L(1, \chi )| \leqslant (\log q)/2\), for all \(q\geqslant 2\). This is proved in [32] after several papers by Louboutin, the last of which is [22]. Bounds relying on additional constraints on the characters at the small primes have been investigated by Louboutin in [23], by the second author in [33], by Saad Eddin in [36] and by Platt and Saad Eddin in [30]. On taking q to be larger, we can improve on the factor 1/2 in Theorem 1.
Theorem 2
Let \(\chi \) be a quadratic primitive Dirichlet character modulo q. The inequality \(L(1,\chi )\leqslant (9/20)\log q\) holds true when \(\chi \) is even and \(q\geqslant 2\cdot 10^{49}\) or \(\chi \) is odd and \(q\geqslant 5\cdot 10^{50}\).
We note that, on the Generalized Riemann hypothesis much more is known. Littlewood [21] showed that \(L(1, \chi ) \ll \log \log q\). This has been made explicit for large q in [15] by Lamzouri, Li and Soundararajan, and then for all q in [17] by Languasco and the third author. Finally, although we do not consider lower bounds on \(L(1, \chi )\), we direct the reader to a survey of explicit and inexplicit bounds of Mossinghoff, Starichkova and the third author in [25], and to the recent work [16].
The outline of this paper is follows. In § 2 we assemble some bounds on prime counting functions and on related inequalities. In § 3 we collect the necessary explicit results on character sums. In § 4 we prepare the technical preliminaries to Stephens’ approach, and analyse these in § 5. Our § 6 is purely centred on the optimization in (an improved version of) Stephens’ method, and contains no number-theoretic input. Finally, in § 7 we prove Theorems 1 and 2.
We use the notation \(f(x)={\mathcal {O}}^*(g(x))\) to mean that \(|f(x)|\leqslant g(x)\) for the range of x considered. Note that this differs from the usual big-O notation, as it takes the implied constant to be 1. We also let
be the usual von Mangoldt function. Throughout this paper we shall let \(H>1\) be a parameter, which ultimately we shall optimise. With that in mind, we define
In addition, for \(x\geqslant 0\) define
We note that the second inequality in (2) follows from the first and partial summation. Namely,
which rearranges to the desired result.
Our aim is to majorize F(1). Define
It is also convenient to introduce the points
2 Preliminary results
We now list a trivial result that follows immediately from partial summation.
Lemma 3
When \(x\geqslant 0\), we have \(\sum _{n\leqslant x}1/\sqrt{n}\leqslant 2\sqrt{x}\).
The following result is slightly more subtle.
Lemma 4
When \(x\geqslant y\geqslant 1\), we have \(S(x, y):= \sum _{y\leqslant n\leqslant x}1/n\leqslant 1+\log (x/y)\).
Proof
First note that we only need to prove the result for y an integer. If \(y\notin {\mathbb {Z}}\), then
Similarly it suffices to prove the result for integral x. Assume, therefore, that \(y\geqslant x\geqslant 1\) where both \(x, y\in {\mathbb {Z}}\). We therefore have
as required. \(\square \)
We now list some bounds related to the prime number theorem. In particular, we give a range of bounds for the Chebyshev function
The first is a classical result from Rosser and Schoenfeld, see [35, Thm 12].
Lemma 5
When \(x\geqslant 0\), we have \(\psi (x)\leqslant 1.04\,x\).
We note that the result of Rosser and Schoenfeld gives 1.03883 in Lemma 5, which is an approximation to \(\psi (113)/113\). To improve the bound in Lemma 5 it would be necessary to take \(x\geqslant x_{0} > 113\), which, while possible, would complicate greatly the ensuing analysis for only a marginal improvement.
The second is an explicit bound of the form \(\psi (x) -x = o(x)\) coming from [3, Table 15] by Broadbent, Kadiri, Lumley, Ng, and Wilk.
Lemma 6
When \(x\geqslant 10^5\), we have \(|\psi (x)-x|\leqslant 0.64673\,x/(\log x)^2\).
On the Riemann hypothesis we have \(\psi (x) -x = O(x^{1/2 + \epsilon })\) for every \(\epsilon >0\). The following result, from [5, Thm 2] of Büthe, gives an explicit version of an even sharper bound for a finite range.
Lemma 7
When \(11< x\leqslant 10^{19}\), we have \(|\psi (x)-x|\leqslant 0.94\sqrt{x}\).
We remark that slightly weaker versions of Lemma 7, but ones that hold in a longer range of x have been provided by the first author in [12]. We require the following result to be used in tandem with Lemma 7.
Lemma 8
When \(e^{40}\leqslant x\), we have \(|\psi (x)-x|\leqslant 1.994\cdot 10^{-8}\,x\).
This is obtained directly from [3, Table 8]. The key feature here is that \(e^{40}<10^{19}\) so that Lemma 7 and Lemma 8 between them cover all values of \(x> 11\). Better results are available when x is very large, say \(\log x \geqslant 1000\) — see [31] by Platt and Trudgian, and [13] by the first author and Yang — but Lemmas 7 and 8 suffice for our needs.
We now turn to estimates on
to aid in the evaluation of \(h(\chi , y)\) and h(1, y) in (1). To obtain such estimates we correct a result of the second author in [34].
Lemma 9
For \(x\geqslant 71\) we have
where \(\gamma \) is the Euler–Mascheroni constant, and where
withFootnote 1\(R=5.69693\) and \(T_0=2.44\cdot 10^{12}\).
Proof
As discussed by Chirre, Hagen, and Simonič in [6], by fixing a couple of small typos, Lemma 2.2 in [34] can be replaced by
where \(\rho \) runs over the non-trivial zeros of the Riemann zeta-function, counting multiplicity. Following [34, §5], we have
Finally, since \(x\geqslant 71\),
\(\square \)
Lemma 10
We have
Proof
Using Lemma 9 with the bounds from Lemmas 6 and 7, we obtain that,
for \(x\geqslant 10^5\), and
for \(10^5\leqslant x\leqslant 10^{19}\). We then extend these estimates to smaller values of x by direct computation, giving (6) and (7). \(\square \)
An immediate consequence of this result is as follows.
Lemma 11
We have
We now examine the weighted average of \(\sum _{n\leqslant u} \Lambda (n)/n\).
Lemma 12
We have
This integral may be of interest in its own right. While the true value of this integral seems close to 0.41, we have no idea of the conjectured limiting value of the integral. To this end, see a similar problem discussed in [2].
Proof
We define \(\Delta (u)=\sum _{n\leqslant u}\Lambda (n)/n-\log u+\gamma \). When the variable u is small, we compute directly by using the fact that \({\widetilde{\psi }}(u)\) is constant on \([n,n+1)\) and that, with \(\tau ={\widetilde{\psi }}(n)+\gamma \), the integral \(\int _n^{n+1}|\Delta (u)|{du}/{u}\) is equal to
The second case is treated by splitting the integral at \(u=e^\tau \). We compute in this manner that
We use Lemma 10 to infer that
We now use Lemma 8 and Lemma 9 to show that, for some \(x_{1}\geqslant 10^{19}\),
To handle the integration beyond \(x_{1}\) we use (6) in Lemma 10, whence the total integral is
Choosing \(x_{1} = \exp (500)\) gives the result. \(\square \)
We remark that we could further divide the range to use more entries in the tables in [3], but the above result is sufficient for our purposes.
3 Character sum estimates
The work of Stephens and Pintz relied on the Burgess bound from [4]. Explicit versions of this are known but are still numerically rather weak. When the modulus is prime, such bounds have been provided by Francis [8] improving on work by Treviño [38] and McGown [24]. If we restrict our attention here to quadratic characters to prime modulus congruent to 1 modulo 4, we may rely on the slightly stronger bounds of Booker in [1]. Recently, Jain-Sharma, Khale and Liu have produced in [11] an explicit version of the Burgess inequality for a composite modulus, but only for q primitive and \(q\geqslant \exp (\exp (9.6))\).
Instead of the Burgess bound we shall rely on versions of the Pólya–Vinogradov inequality. We first require an explicit version of the Pólya–Vinogradov inequality.
The following is from [18, 19] by Lapkova, which makes a small improvement on the earlier result from [9, Theorem 2] by Frolenkov and Soundararajan.
Lemma 13
When \(q>1\) and \(\chi \) is a primitive Dirichlet character modulo q, we have
When \(A=0\) and \(\chi \) is even, we may divide this bound by 2.
In what follows, we write \(V= V(\chi )\) for brevity, and apply the appropriate bound from Lemma 13 according to the parity of the character \(\chi \).
Here is a smoothed version of the Pólya–Vinogradov inequality that we take from Levin, Pomerance and Soundararajan in [20].
Lemma 14
Let \(\chi \) be a primitive Dirichlet character modulo \(q>1\). Let M and N be real numbers with \(0<N\leqslant q\). With \(W(t)=\max (0,1-|t-1|)\), we have
Lemma 15
Let \(\chi \) be a primitive Dirichlet character modulo \(q>1\). Let M and N be real numbers with \(0<N\leqslant q\). When \(\chi \) is odd,we have
When \(\chi \) is even, we have
Proof
We may assume that M is an integer. Notice first that the lemma is trivial when \(N\leqslant \sqrt{q}\), so we may assume \(N>\sqrt{q}\). Let \(K\geqslant 1\) be an integer and let \(A=N/K\). Keeping the notation of Lemma 14, we first notice that
Therefore
which is readily seen to be of size at most \(\frac{A}{2}+1\). On using Lemma 14, we get
We let \(K=1+[q^{-1/4}\sqrt{N/2}]\) and write \(K = c + q^{-1/4}\sqrt{N/2}\) with \(c\in (0,1]\). We find that
By computing the derivative with respect to c, we check that this quantity is maximised at \(c=1\). The lemma follows readily. \(\square \)
Before introducing the next lemma, we recall the functions F, f defined in (2).
Lemma 16
We have \( L(1,\chi )=F(1)\log H+\mathcal {O}^*(VH^{-1})\), where V is defined in Lemma 13.
Proof
By summation by parts, we find that
hence
\(\square \)
4 Preliminaries to Stephens’ approach
Using the definition of f(x) from (2) in § 1, we have
Now, \(\Lambda (m)\) is only non-zero when m is a prime power, so
We now write \(s=\prod _ip_i\alpha ^i\) as the prime decomposition for each \(s\leqslant H^x\), so that (8) becomes
using the definition of \(\ell (x)\) from (3). We therefore have
We now recast this for greater ease of use in what follows.
Lemma 17
We have, for \(x\geqslant 0\),
If \(H\geqslant V> 1\) we also have \(\int _0^1 f(u)H^udu/H=\mathcal {O}^*(1/\log H)\) and
where
We note that the proofs of Theorems 1 and 2 only require the upper bound in the \(\mathcal {O}^{*}\) error term in (10): see (17) for where this is used. Nevertheless, it is easy enough to prove (10) as it is written.
Proof
We find that
and the first part of the lemma follows readily. Concerning the upper bound for \(|\int _0^1 f(u)H^udu|/H\), we proceed as follows.
4.1 Case of even characters
By Lemma 13 and 15, we have three upper bounds for |f(u)|: either 1, \(q^{1/4}H^{-u/2}+\frac{1}{2}q^{1/2}H^{-u}\) or \(V/(2H^u)\). We have \(q^{1/4}H^{-u/2}+\frac{1}{2}q^{1/2}H^{-u}\leqslant 1\) when \(H^u/\sqrt{q}\geqslant 1+\sqrt{3}\). We momentarily set \({\tilde{V}}=V/2\). We define
Define the real parameter a by \(\frac{1}{2}(1-a)\log H=\log (\sqrt{\sqrt{q}H}/{\tilde{V}})\). We get
4.1.1 Case of odd characters
Again by Lemma 13 and 15, we have three upper bounds for |f(u)|: either 1, \(q^{1/4}\sqrt{2}H^{-u/2}+q^{1/2}H^{-u}\) or \(V/H^u\). We have \(q^{1/4}\sqrt{2}H^{-u/2}+q^{1/2}H^{-u}\leqslant 1\) when \(H^u/\sqrt{q}\geqslant 2+\sqrt{3}\). We define
Define the real parameter a by \(\frac{1}{2}(1-a)\log H=\log (\sqrt{2\sqrt{q}H}/V)\). We get
4.1.2 Resuming the proof
Inequality (10) follows: indeed, by (9), the left-hand side is \(\ell (1)/\log H\) which we compute with the first formula of the present lemma. We complete the proof by using the bound above for \(\int _0^1 |f(u)|H^udu\). \(\square \)
Lemma 18
We have, for \(x\geqslant 0\),
Proof
On joining (9) and Lemma 17, we get
This is the equivalent of [37, (55)] by Stephens. The next step is to integrate the above relation:
As for the left-hand side, we first check that
And finally
by bounding |f(u)| by 1. \(\square \)
Lemma 19
We have, when \(x\geqslant 0\)
Proof
We start from the right-hand side:
Recall \({\widetilde{\psi }}\) from (5). We approximate \({\widetilde{\psi }}(H^{x-t})\) by \((x-t)\log H-\gamma \), getting the main term and this is \(\int _0^xF(t)dt-F(x)\frac{\gamma }{\log H}\) and treat the error term by bounding |f(t)| by 1:
We then majorize this last term by Lemma 12. If follows from the definition of F in (2) that this last term is not more than \(0.411/\log ^2H\). \(\square \)
Lemma 20
We have, when \(x\geqslant 0\),
Proof
5 A comparison and the main inequality
This section is devoted to the comparison between
and F(1), where \(x_{m}\) is defined in (4). The important observation, essentially due to Stephens, is that since f has tame variations, both should be about equal. In § 7, where we prove Theorems 1 and 2, we need only to bound (12) from below by F(1) plus some error term.
We first connect F(1) with the bounds on character sums, that is, with the V from Lemma 13.
Lemma 21
We have, for any \(D\geqslant 1\),
Proof
We have
Using that \(|\sum _{A\leqslant n \leqslant B} \chi (n)| \leqslant V\) yields the desired result. \(\square \)
Lemma 22
Let \(D_0\geqslant 1\), and \(A_2\) be such that
We then have, for any \(D\geqslant D_0\),
Please notice that we would need only the lower estimate in the last bound.
Proof
We write
By Lemma 3, the last sum over n is bounded in absolute value by V. It then follows by Lemma 5 that the second summand of (14) satisfies
Concerning the first summand of (14), we use three steps. For the first step, we restrict to the range \(H/10^{19}<n\leqslant H/D\) and use (13). Note that Lemma 7 tells us that we can take \(A_2=0.94\) provided \(D_0>11\). A quick calculation also shows that \(A_2=\sqrt{2}\) works for \(D_0\geqslant 1\), or \(A_2=0.956\) works for \(D_0\geqslant 7\). Now,
where for the second equality we used Lemma 3.
For the second step, we use Lemma 8 and consider the range \(H/A<n\leqslant H/10^{19}\), where \(A\geqslant \exp (40)\) is to be chosen later. That is,
where for the second equality we used Lemma 4.
For the third step we consider the sum over \(n\leqslant H/A\). First, if \(H<A\) then there is nothing to add. On the other hand, if \(H\geqslant A\) we use Lemma 6 to get
Since \(n\log ^2 (H/n)\) is increasing when \(n\leqslant H/e^2\), we have that
Since the above is decreasing in H, and \(H\geqslant A\), we can set \(A=\exp (574)\) to bound the \({\mathcal {O}}^*\) terms in (15) and (16) by \(1.6\cdot 10^{-5}H\). \(\square \)
Lemma 23
For any \(D\geqslant D_{0}\geqslant 1\)
where \(A_{2}\) is as in Lemma 22.
Proof
By using the definition of f, we get
and we appeal to Lemma 22. This leads to
Note further that, by Lemma 21 (we need only the upper estimate), we have
\(\square \)
We are now in a position to prove the following crucial lemma. Recall the definitions of h(1, x) and \(h(\chi , x)\) from (1), and of \(R_{\chi }(H, V, q)\) from (11).
Lemma 24
Let \(H\geqslant 10^6\) and \(x\geqslant 1/2\). Then we have
Also, if H also satisfies \(H\geqslant V\),
where \(A_2\) is as in Lemma 22 when D is taken to be \(\left( \frac{A_2}{2.04}\frac{H}{V}\right) ^{2/3}\) (see (19)).
This is the equivalent of [37, Lemma 2] by Stephens.
Proof
The first inequality follows by Lemma 11. Concerning the second one, we proceed as follows. Define
Since \(|\chi (m)|\), \(|f(x_m)|\leqslant 1\), we have \(S\geqslant 0\). Furthermore, on expanding and using the second part of Lemma 17, we find that
Now we use Lemma 23. Since \(S\geqslant 0\), this leads to the inequality
We select
so that the expression in ((18)) involving D is minimised. This then gives
Let us extend this inequality to \(h(\chi ,x)\). We simply write
hence the result, since \(2h(1,1)/\log H\leqslant 2-2\times 0.576/\log H\) by Lemma 11 and \(1.6\cdot 10^{-5} -2\times 0.576\leqslant -1.15\). \(\square \)
6 A result in optimization
This section contains a refined version of a result by Stephens: see Theorem 4 in [37]. No further arithmetical material is being introduced. We start with a technical lemma.
Lemma 25
We have, for \(\theta \) fixed and \(\theta \in (0, x)\),
Proof
Notice that \(2\int u\log u du=u^2\log u-(u^2/2)\) and thus
Next,
and thus
whence the lemma follows after some simple algebraic rearrangement. \(\square \)
Lemma 26
Let \(H>1\) be a real parameter. Suppose we are given a sequence of non-negative real numbers \((u_m)_{1\leqslant m\leqslant H}\) and a continuous function G over [0, 1]. Assume we have, for every \(x\in [0,1]\), that
that for some parameters a and \(\varepsilon _2\), we have, when \(x\geqslant 1/2\),
that
and that, for some parameter \(\varepsilon _1\) we have, when \(x\geqslant 1/2\),
Then either \(G(1)\leqslant 2(1-1/\sqrt{e})\) or
where \(\theta =1-G(1)/2\) belongs to \([1/2,1/\sqrt{e}]\).
Proof
Set
The function \(\varphi \) is increasing (its derivative is \(-2\log y\)) on (0, 1] and takes the positive value \(-2\theta \log \theta \) at \(y=\theta \). Note that \(\theta \geqslant 1/2\) since \(G(1)\leqslant 1\), and that when \(\theta \geqslant 1/\sqrt{e}\), our result is immediate. Let us assume that \(\theta < 1/\sqrt{e}\) so that \(\theta +2\theta \log \theta <0\). Assume that, when \(\theta \leqslant y\leqslant Z\), we have \(G(y)\leqslant \varphi (y)\). This latter inequality translates into
Our initial remark is that \(\theta \) is such a number.
Proof
Indeed, if it where not, we would have
since \(G(x)\leqslant x\). We notice next that \(G(1)=2-2\theta \), so that the above inequality can be rewritten as \(G(1)\leqslant G(1)+\theta +2\theta \log \theta <G(1)\) by the inequality assumed for \(\theta \), leading to a contradiction. \(\square \)
We define for this proof
We find that, for \(Z\geqslant x\geqslant \theta \),
by bounding above G(y) by y by \((H_0\)) when \(y\leqslant \theta \). We study separately the two right-hand side sums, say \(S_1\) and \(S_2\). First we note that, on recalling the definition (20) of g:
while
and this amounts to
In the first integral, we bound above \(g(x-u)\) by \(2(x-u)\) by \((H_2)\). We split the second integral at \(u=\theta \); between \(x-\theta \) and \(\theta \), we bound above g(u) again by 2u while in the later range, we bound above g(u) by \(2\theta +\varepsilon _1\) by \((H-3)\) (valid since \(u\geqslant \theta \geqslant 1/2\)). We infer in this manner that
By Lemma 25 and noticing that \(\varphi (\theta )-\theta =-\theta (1+2\log \theta )\), we get (again bounding above \(g(x-u)\) by \(2(x-u)\) by \((H_2)\))
By \((H_1)\) and the above, we infer that
We also find that, when \(\theta \leqslant 1/\sqrt{e}\), we have
Hence, we get
We can now use \(\varphi (x)\geqslant \varphi (\theta )=-\theta \log \theta \), getting
When \(2a\theta \log \theta - 2\theta (1/\sqrt{e}-\theta )(2+\log \theta ) +\varepsilon _1+\varepsilon _2<0\), we would have \(G(x)<\varphi (x)\). However the function G is continuous and \(G(1)=\varphi (1)\), there exists an \(x_0\) between \(\theta \) and 1 for which \(G(x_0)=\varphi (x_0)\) and \(G(x)\leqslant \varphi (x)\) for x between \(\theta \) and \(x_0\). The above inequality then leads to a contradiction. Hence we have
\(\square \)
7 Proof of Theorems 1 and 2
We use Lemma 26 with \(G(x)=F(x)\) and \(u_m=(1+\chi (m))\Lambda (m)/m\).
7.1 Initial upper bound
Lemma 16 gives us
7.1.1 Hypotheses \((H_0)\), \((H_1)\), \((H_2)\) and \((H_3)\)
Hypothesis \((H_0)\) is granted by the bound \(|f(u)|\leqslant 1\). By Lemma 20 we can then set
and this gives us Hypothesis \((H_1)\).
Lemma 10 is enough to grant Hypothesis \((H_2)\). Finally, by Lemma 24 and provided that \(H\geqslant \max (V,10^6)\), Hypothesis \((H_3)\) is satisfied with
We will further majorize f(1) by V/2 when \(\chi \) is even and by V/H when \(\chi \) is odd.
7.1.2 Using Lemma 26
So we infer that
where \(\theta \in [1/2,1/\sqrt{e}]\) satisfies
Since \(a<0\), if this inequality is satisfied for some \(H_0>1\) then it remains true for \(H\geqslant H_0\). We select \(H=BV\), for some parameter B, and bound |f(1)| by V/H. Therefore, if \(q\geqslant q_{0}\), for some \(q_{0}>1\) which we shall specify later, we have that
So, here are possible choices:
7.1.3 Setting the numerics
We can now prove Theorems 1 and 2. We use the expression for V given in Lemma 13. We take \(H=BV\) which we assume to be \(\geqslant 10^6\), we also assume that \(q\geqslant q_0\) so that \(V\geqslant V_0\). Given a choice of B, we select
where \(\delta (\chi )=(3-\chi (-1))/4\). We then compute the smallest solution \(\theta ^*\) to (21) and infer that
Result for \(\chi \) even and primitive: We select \(B=51\), and infer that \(L(1,\chi )<\frac{1}{2}\log q\) when \(q\geqslant 7\cdot 10^{22}\). But this is already known for all q’s by [32]. Even more is true if we combine the theorem of Saad Eddin in [36] together with [33, Corollary 1].
We select \(B=80\), and infer that \(L(1,\chi )<\frac{9}{20}\log q\) when \(q\geqslant 2\cdot 10^{49}\).
Result for \(\chi \) odd and primitive: We select \(B=90\), and infer that \(L(1,\chi )<\frac{1}{2}\log q\) when \(q\geqslant 2\cdot 10^{23}\).
We select \(B=145\), and infer that \(L(1,\chi )<\frac{9}{20}\log q\) when \(q\geqslant 5\cdot 10^{50}\).
Data availibility
The computational code for all calculations done in this paper is available upon request to the authors.
References
Booker, A.R.: Quadratic class numbers and character sums. Math. Comput. 75(255), 1481–1492 (2006)
Brent, R.P., Platt, D.J., Trudgian, T.S.: The mean square of the error term in the prime number theorem. J. Number Theory 238, 740–762 (2022)
Broadbent, S., Kadiri, H., Lumley, A., Ng, N., Wilk, K.: Sharper bounds for the Chebyshev function \(\theta (x)\). Math. Comput. 90(331), 2281–2315 (2021)
Burgess, D.A.: On character sums and \(L\)-series. Proc. Lond. Math. Soc. 3(12), 193–206 (1962)
Büthe, J.: An analytic method for bounding \(\psi (x)\). Math. Comput. 87(312), 1991–2009 (2018)
Chirre, A., Hagen, M.V., Simonič, A.: Conditional estimates for the logarithmic derivative of Dirichlet \(L\)-functions. Preprint available at arXiv:2206.00819. https://doi.org/10.1016/j.indag.2023.07.005
Davenport, H.: Multiplicative Number Theory. Graduate Texts in Mathematics, Springer, New York (2000)
Francis, F.J.: An investigation into explicit versions of Burgess’ bound. J. Number Theory 228, 87–107 (2021)
Frolenkov, D.A., Soundararajan, K.: A generalization of the Pólya–Vinogradov inequality. Ramanujan J. 31(3), 271–279 (2013)
Hua, L.-K.: On the least solution of Pell’s equation. Bull. Am. Math. Soc. 48, 731–735 (1942)
Jain-Sharma, N., Khale, T., Liu, M.: Explicit Burgess bound for composite moduli. Int. J. Number Theory 17(10), 2207–2219 (2021)
Johnston, D.R.: Improving bounds on prime counting functions by partial verification of the Riemann hypothesis. Ramanujan J. 59(4), 1307–1321 (2022)
Johnston, D.R., Yang, A.: Some explicit estimates for the error term in the prime number theorem. Preprint available at arXiv:2204.01980
Kadiri, H.: Une région explicite sans zéros pour la fonction \(\zeta \) de Riemann. Acta Arith. 117(4), 303–339 (2005)
Lamzouri, Y., Li, X., Soundararajan, K.: Conditional bounds for the least quadratic non-residue and related problems. Math. Comput. 84(295), 2391–2412 (2015)
Languasco, A.: Numerical estimates on the Landau-Siegel zero and other related quantities. J. Number Theory. 251, 185–209 (2023)
Languasco, A., Trudgian, T.S.: Uniform effective estimates for \(|L(1,\chi )|\). J. Number Theory 236, 245–260 (2022)
Lapkova, K.: Explicit upper bound for an average number of divisors of quadratic polynomials. Arch. Math. (Basel) 106(3), 247–256 (2016)
Lapkova, K.: Correction to: explicit upper bound for the average number of divisors of irreducible quadratic polynomials [MR3829216]. Monatsh. Math. 186(4), 675–678 (2018)
Levin, M., Pomerance, C., Soundararajan, K.: Fixed points for discrete logarithms. In Algorithmic Number Theory, volume 6197 of Lecture Notes in Comput. Sci., pp. 6–15. Springer, Berlin (2010)
Littlewood, J.E.: On the class-number of the corpus \(P({\surd }-k)\). Proc. Lond. Math. Soc. 27(5), 358–372 (1928)
Louboutin, S.: Majorations explicites de \(|L(1,\chi )|\). III. C. R. Acad. Sci. Paris Sér. I Math 332(2), 95–98 (2001)
Louboutin, S.: Explicit upper bounds for \(|L(1,\chi )|\) for primitive even Dirichlet characters. Acta Arith. 101(1), 1–18 (2002)
McGown, K.J.: Norm-Euclidean cyclic fields of prime degree. Int. J. Number Theory 8(1), 227–254 (2012)
Mossinghoff, M.J., Starichkova, V.V., Trudgian, T.S.: Explicit lower bounds on \(|L (1, \chi )|\). J. Number Theory 240, 641–655 (2022)
Mossinghoff, M.J., Trudgian, T.S.: Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function. J. Number Theory 157, 329–349 (2015)
Mossinghoff, M.J., Trudgian, T.S., Yang, A.: Explicit zero-free regions for the Riemann zeta-function. Preprint available at arXiv:2212.06867
Pintz, J.: Corrigendum: “Elementary methods in the theory of \({L}\)-functions, VII. Upper bound for \({L}(1, \chi )\)’’. Acta Arith. 33(3), 293–295 (1977)
Pintz, J.: Elementary methods in the theory of \({L}\)-functions, VIII. Real zeros of real \({L}\)-functions. Acta Arith 33(1), 89–98 (1977)
Platt, D.J., Saad Eddin, S.: Explicit upper bounds for \(|L(1,\chi )|\) when \(\chi (3)=0\). Colloq. Math. 133(1), 23–34 (2013)
Platt, D.J., Trudgian, T.S.: The error term in the prime number theorem. Math. Comput. 90(328), 871–881 (2021)
Ramaré, O.: Approximate formulae for \({L}(1,\chi )\). Acta Arith. 100, 245–266 (2001)
Ramaré, O.: Approximate formulae for \({L}(1,\chi )\). II. Acta Arith. 112, 141–149 (2004)
Ramaré, O.: Explicit estimates for the summatory function of \({\Lambda }(n)/n\) from the one of \({\Lambda }(n)\). Acta Arith. 159(2), 113–122 (2013)
Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6, 64–94 (1962)
Saad Eddin, S.: An explicit upper bound for \(|L(1,\chi )|\) when \(\chi (2)=1\) and \(\chi \) is even. Int. J. Number Theory 12(8), 2299–2315 (2016)
Stephens, P.J.: Optimizing the size of \({L}(1,\chi )\). Proc. Lond. Math. Soc. III. Ser 24, 1–14 (1972)
Treviño, E.: The Burgess inequality and the least \(k\)th power non-residue. Int. J. Number Theory 11(5), 1653–1678 (2015)
Acknowledgements
We are grateful to Enrique Treviño for some preliminary insights on this topic. We thank Tanmay Khale for discussions on [11] and Stéphane Louboutin for his suggestions leading to our Lemma 4. Finally, we are very grateful to the referees for thoroughly reading our manuscript and for many useful suggestions for improvements.
Funding
Open Access funding enabled and organized by CAUL and its Member Institutions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Johnston, D.R., Ramaré, O. & Trudgian, T. An explicit upper bound for \(L(1,\chi )\) when \(\chi \) is quadratic. Res. number theory 9, 72 (2023). https://doi.org/10.1007/s40993-023-00476-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40993-023-00476-4