The positivity technique and low-lying zeros of Dirichlet -functions
Abstract.
Assuming the generalized Riemann hypothesis, we rediscover and sharpen some of the best known results regarding the distribution of low-lying zeros of Dirichlet -functions. This builds upon earlier work of Omar, which relies on the classical positivity technique of explicit formulas. In addition, we generalize some of our results to a larger class of -functions and provide effective conditional estimates for the lowest zeros of Dirichlet -functions.
Key words and phrases:
Dirichlet -functions, low-lying zeros, explicit formulas2020 Mathematics Subject Classification:
11M06, 11M26, 11M411. Introduction and statement of results
1.1. Individual Dirichlet -functions
We investigate several important quantities that naturally arise in the study of low-lying zeros of Dirichlet -functions. Throughout this paper denotes a Dirichlet character with conductor unless otherwise specified. Let (resp., ) be the height of the lowest (resp., lowest non-real) non-trivial zero of . That is,
Further, let be the order of vanishing of at the central point. Siegel [Sie45, Theorem IV] (see also the last paragraph of [Sie45]) proved that as , and to be precise, that
(1) |
Omar [Oma08] established the bound and verified Chowla’s conjecture, which asserts that for all (originally stated only for real [Cho65]), for real primitive characters of modulus up to . Conditionally on the generalized Riemann hypothesis (GRH), Omar [Oma08, Theorem 7] showed that
(2) |
and used this to improve (1) to [Oma08, Theorem 11]
(3) |
These results are achieved by the positivity technique, which involves applying a specialized form of Weil’s explicit formula to test functions with suitable properties, as will be explained in §2. This method was originally developed by Odlyzko and Serre, and subsequently improved by Poitou [Poi77], to furnish lower bounds on discriminants of number fields. We refer the reader to [Odl90] for a survey of its historical background and earlier development, and to [Mil02, Oma00, Oma14] for further applications to studying the first zeros of various families of -functions.
For an alternative way to arrive at (2) and (3), one may start with the Riemann–von Mangoldt formula (see, e.g., [MV07, Corollary 14.6])
(4) |
Here counts the number of zeros of with and (any zero with ordinate exactly equal to is counted with weight ), and
if for any , otherwise . Under GRH, it is known that uniformly in and due to a result of Selberg [Sel46]. Taking on the right-hand side of (4) gives (2), and so when , proving (3). Using the theory of Beurling–Selberg type extremal functions, Carneiro, Chandee and Milinovich [CCM15, Theorem 6 & Example 8] sharpened the conditional bound on to
(5) |
Consequently,
(6) |
and
(7) |
By the same reasoning as above, (6) implies that
(8) |
1.2. The family of Dirichlet -functions modulo
Much more work has been done towards understanding the distribution of low-lying zeros in families of Dirichlet -functions, for example the family of quadratic Dirichlet -functions and the family of all Dirichlet -functions of a fixed modulus. In the latter direction, Murty [Mur90] showed under GRH that
(9) |
essentially by using the positivity technique. As a result, for any the proportion of mod such that is at least for all sufficiently large . By constructing certain extremal functions in reproducing kernel Hilbert spaces, Carneiro, Chirre and Milinovich [CCM22] improved on the average order of vanishing at low-lying heights of the form for , but at (9) has not been updated so far 111For the family of primitive Dirichlet -functions with conductors , the non-vanishing proportion at the central point has been extended beyond for large , unconditionally by Pratt [Pra19] and conditionally by Drappeau et al. [DPR23].. The best unconditional result in this direction is due to Bui [Bui12] who proved that for at least of the primitive characters modulo . Restricting to prime moduli, Khan, Milićevié and Ngo [KMN22] improved this proportion to .
In their seminal work [HR03], Hughes and Rudnick established, assuming GRH, the one-level density for the unitary family of Dirichlet -functions modulo for test functions with . As a corollary, they [HR03, Theorem 8.1] showed that
(10) |
(The restriction of to primes is to ensure that each non-principal mod is primitive, which simplifies the discussion.) In other words, there exists zeros as low as of the average spacing between consecutive zeros. Using the variance of the one-level density, they [HR03, Theorem 8.3] also proved that for any ,
(11) |
For instance, we see by taking that at least of the characters modulo have low-lying zeros within the expected height, and this proportion increases to as .
1.3. Statement of results.
The purpose of this work is further develop Omar’s argument in [Oma08] to reprove and refine some of the aforementioned results, in hopes of demonstrating the versatility and efficacy of the positivity technique, which is at the same time relatively simple and straightforward. For individual Dirichlet -functions, we refine (6), (7) and (8) by removing a factor from each error term. In particular, this argument circumvents the intricate analysis of and thus has the additional advantage that it can easily be made fully explicit (see Theorem 16).
Theorem 1.
Assuming GRH,
(12) |
Moreover, for any constant , has at least zeros with height at most .
This result indicates that if (12) turns out to be optimal for some primitive (although this is not the case in all likelihood), then for all , the average spacing between zeros with height
is at most .
Theorem 2.
Assuming GRH,
Theorem 3.
Assuming GRH,
Remark 1.
Despite the advantages discussed above, our approach does have the drawback that the qualities of our estimates become inferior away from , whereas the method of Carneiro et al. in [CCM15] applies to the order of vanishing at any height and to the distance between two arbitrary consecutive zeros. We also have to choose a different test function for each estimate, which might seem somewhat ad hoc, while (6)-(8) follow readily from (5) all at once.
In fact, (5)-(8) are special cases of results in [CCM15] that are applicable to a larger class of -functions including those associated to cuspidal automorphic representations of over a number field. These results sharpen what Omar obtained in this general setting [Oma14]. Thus, for completeness, we shall give extensions of Theorems 1–3 in §7.
Theorem 4.
Assuming GRH,
Hence, the proportion of satisfying is strictly greater than for all sufficiently large .
Theorem 5.
Assuming GRH,
Notice that the restriction of to primes is removed from (10). A similar estimate holds for with replaced by on the right-hand side.
In the other direction, we prove the following result on large heights of the first zeros:
Theorem 6.
Assuming GRH,
where is Euler’s constant.
Regarding the proportion of characters with low-lying zeros, we improve (11) for all .
Theorem 7.
Let be the unique number in at which the function is minimized. Assuming GRH,
where and . In particular, the left-hand side converges to 1 as .
Without any constraints on the modulus , we give in Remark 4 a slightly smaller proportion that is as . These results imply that although we are unable to rule out the existence of satisfying (see Theorem 1), the proportion of such characters is as . A similar estimate for the family of quadratic Dirichlet -functions is obtained in Theorem 14.
For the proof, in contrast to Hughes and Rudnick’s approach (of fixing some test function and applying Chebyshev’s inequality using the variance of the one-level density), we pursue a more direct cardinality argument based on the Cauchy–Schwarz inequality and allow for flexibility with the choice of the test function (see §4.6).

2. Preliminaries and lemmas
2.1. Weil’s explicit formula
We begin by stating the version of Weil’s explicit formula as formulated by Barner [Bar81] and adapted for . We say that a function is admissible if it is even and satisfies along with the following properties:
-
(a)
is continuously differentiable everywhere except at finitely many points for which .
-
(b)
There exists such that and are both as .
Put
(13) |
Then we have the following:
Theorem 8 (Weil).
For any admissible function ,
(14) |
where the sum on the left-hand side runs over the non-trivial zeros of with (counted with multiplicity) and
As usual, denotes the von Mangoldt function, which takes on the value when is a prime power, and 0 otherwise.
2.2. Overview of the positivity technique
Define the Fourier transform of an admissible function by
(15) |
Note that if , then and where . We assume GRH henceforth, so that every non-trivial zero is of this form.
To see how to bound from above, suppose that for and that for . Putting (we may assume that ), we have for each . If we can estimate the second and third terms on the right-hand side of (14) in terms of , then for sufficiently large this will lead to a lower bound on in terms of , and hence an upper bound on .
The treatment for is similar, but we get a weaker bound because the zeros at do make a positive contribution to the sum. To make this precise, we first derive an upper bound on by applying (14) to for some with non-negative Fourier transform . By dropping the contribution from all zeros , we see that the left-hand side is at least , and the problem therefore reduces to bounding the right-hand side and choosing the optimal .
Finally, when considering the family of all non-principal mod simultaneously, we sum both sides of (14) over and exploit the orthogonality of characters instead of trivially bounding the sum over prime powers by the triangle inequality.
2.3. Test functions
We now describe two classes of admissible functions that could be used to derive an upper bound on , for which we require that outside of some bounded interval. For practical reasons we also need to be compactly supported. The first has the form
(16) |
where . (Omar fixes in [Oma08], while our will be a parameter depending on .) One can check that
(17) |
so that for .
Another example is given by the Fourier transforms of the Beurling–Selberg minorants for symmetric intervals with . In the 1930s, Beurling studied the entire functions
and observed that for all , that , and that 222Here we interpret in the sense of distributions as . has compact support in . The Beurling–Selberg minorant for is then given by
(18) |
One can show that (see §4.5). Now define for
(19) |
It is not hard to verify that , that is even and compactly supported in , and that , which denotes the characteristic function on . (In particular, for all .) See [Vaa85] for a detailed exposition on the constructions and some earlier applications of such functions.
2.4. Lemmas
To end this section we introduce two lemmas concerning the term and the sum over prime powers that appear in the explicit formula (14) when applied to the test function as defined in (16). The proofs can easily be adapted for other test functions.
Lemma 9.
where the implied constant is absolute.
Proof.
Since is compactly supported in ,
where or according as is even or odd. Also recall that , so by the mean value theorem there exists such that the first integral can be rewritten as
Note that on and that the integral above converges. By Gauss’ Digamma theorem, the second integral equals
The third integral is plainly , and the proof is complete. ∎
Lemma 10.
For and large ,
Proof.
We claim that when ,
(20) |
Since , it suffices to show that , or , for . This is readily seen from the Taylor expansions of both sides.
As usual, let denote the Chebyshev function. Then, using (20), we can trivially bound the sum by
(21) | ||||
where we invoked the prime number theorem (in the weak form) . ∎
3. Estimates for individual Dirichlet -functions: proofs of Theorems 1–3
3.1. Bounding : proof of Theorem 1
Assume that , i.e., , since the theorem trivially holds otherwise. Consider the function with from (16) and . We see from (3) that . Note that because for all . Thus, in view of Theorem 8 and Lemmas 9 and 10, we have
Set and
so that . Then
On expressing in terms of and and appealing to the fact that as , we arrive at
which completes the proof of (12).
Next we prove the second assertion regarding the number of zeros below with . Let be the positive integer such that (here denotes the zero ordered by height), and our goal is to show that
(22) |
Take for some parameter . For , we have for all , and then another application of (14) gives
After rearranging the inequality we find that
Finally, it is a calculus exercise to determine that the optimal choice of is , which yields (22).
Remark 2.
By examining the the first part of the preceding proof and the proof of Lemma 10, we see that if the chosen test function is supported in and for , then the coefficient of the leading term in the bound on would be . For our choice , and as , which leads to the coefficient . Alternatively, we could work with as defined in (19) with and , and we obtain the same coefficient by letting . However, it would be harder to determine the lower order terms in the estimate because of the more complicated nature of .
3.2. Bounding : proof of Theorem 2
3.3. Bounding : proof of Theorem 3
Define
(24) |
where stands for the convolution of and . Note that is admissible, and in particular, that it is supported in with . Moreover, for .
If , consider with , so that except when . Since and for , we have , which gives
by a similar argument as in the proof of Lemma 10. Also since , and hence
(25) |
where . A quick proof by contradiction shows that if for and positive numbers , and , then
for any . In view of (25) and Theorem 2,
where is an absolute constant. Choosing and , we find that
which yields the stated estimate for .
4. Estimates for the family of Dirichlet -functions modulo : proofs of Theorems 4–7
4.1. Lemmas
We start with an estimate on the average size of conductors of characters modulo .
Lemma 11.
where stands for the conductor of .
Proof.
The upper bound is clear with equality attained whenever is a prime. On the other hand, one can show that (see [FM13, Proposition 3.3])
Let denote the number of distinct prime divisors of , and the prime. Since is decreasing, the last sum over is
where we used the standard fact that . ∎
Next we introduce an averaged version of Lemma 10.
Lemma 12.
where the implied constant is absolute.
Proof.
We assume that , otherwise it will be clear how to modify (actually simplify) the argument. By (20) and the orthogonality relation of characters
(26) |
we obtain
where . The first term is plainly . By the Brun–Titchmarsh theorem [MV73, Theorem 2], for , from which it follows that the sum of the two remaining terms is . Multiplying by gives the desired upper bound. Similarly,
Finally, the contribution from higher powers of primes can be absorbed into the stated estimate. ∎
4.2. Average of : proof of Theorem 4
4.3. Minimum of : proof of Theorem 5
4.4. Maximum of : proof of Theorem 6
Define , that is,
(27) |
which is an admissible function with
A short calculation reveals that vanishes up to the second derivative as , and more precisely one has . It follows as in the proof of Lemma 12 that
Moreover, we see from the proof of Lemma 9 that
and thus
by the orthogonality relation (26).
For , denote by the number of zeros of with . The non-negativity of implies that
We aim to maximize subject to the condition that
(28) |
for all large , since then the average number of zeros below will be strictly less than 1. Choose , so the big- term in the numerator of (28) is . As (for , say, such that is monotonically decreasing on ), in view of (28) it suffices to ensure that
Indeed, if where , then the left-hand side becomes
and hence we can take , as required.
Remark 3.
4.5. Proportion of having small zeros: A first improvement
Before proving Theorem 7, we describe a quick way of improving on (11) for large via a simple change of test function. Hughes and Rudnick’s proof of (11) relies on the following result:
Lemma 13.
Let be a real, even function with such that is supported in and that . If for with and otherwise, then
(30) |
Proof.
The test function they chose to work with is essentially where is appropriately determined in terms of . Here we propose a different option. Recall from (18) that and take
which is given by the explicit expression
(31) |
(Note that restricting to integers would not weaken the result asymptotically considering the monotonicity of the proportion on the left-hand side of (30).) See §2 for a brief discussion of some essential properties of , which satisfies all the assumptions in Lemma 13. In particular,
for , and it is clear from (31) that for (this is where we need ) and that .
Now, since , we have
and
for any . Hence
and it follows by Lemma 13 that
for . This is already strong enough to show that the proportion converges to 1 as .
4.6. Proportion of having small zeros: proof of Theorem 7
Let be a large prime. For , let (which is non-empty by Theorem 5) and
In addition, we suppose that . By the Cauchy–Schwarz inequality
(32) |
We first bound the numerator from below. The key observation is again that , which implies that
where we applied Lemma 12. On the other hand, the denominator is at most
(33) | ||||
The second term on the right-hand side contributes by Lemma 12 again, and according to (26) the third term is
We treat and as follows. First,
where we used (20) in the second step. Next observe that if and , then we must have . Hence
Inserting these estimates into (32) gives
where , provided that , which holds for all large enough so long as . We therefore have
The function attains its minimum on at with , and is increasing on . It thus follows that
which concludes the proof.
Remark 4.
We can remove the restriction to prime moduli at the cost of a weaker bound. For a general , the second term in (4.6) has to be replaced by
which is not necessarily negligible since orthogonality is no longer applicable. However, this is at most
by the Cauchy–Schwarz equality and our treatment of the third term in (4.6). Arguing as before with minor variations, we deduce that
5. Some remarks on quadratic Dirichlet -functions
5.1. Non-vanishing at the central point
It is natural to consider extending our previous arguments to the family of real primitive characters. For a fundamental discriminant , write for the associated Kronecker symbol. Unconditionally, Soundararajan [Sou00] showed that for at least of the ’s by studying the mollified moments of ; at around the same time, Özlük and Snyder [OS99] proved a proportion of assuming GRH by establishing the one-level density for the symplectic family of quadratic Dirichlet -functions for test functions with 333The one-level density in this setting reveals that the low-lying zeros of quadratic Dirichlet -functions are sparser than on average, which explains why these non-vanishing results are far better than what we can prove in the case where all Dirichlet -functions are included., which was independently discovered by Katz and Sarnak [KS99]. We demonstrate below a simple way of obtaining the less optimal proportion under GRH (which did not seem to have ever appeared in the literature prior to the aforementioned works) that uses only the explicit formula and the following mean square estimate for character sums due to Jutila [Jut73, Corollary to Theorem 1]:
(34) |
where the outer sum runs over non-square positive integers and the inner sum runs over fundamental discriminants with , with the implied constant being absolute. On average this saves an factor from the pointwise bound
(35) |
for (see, e.g., [Ayo63, pp. 325]) 555We point out a small misuse of the Pólya–Vinogradov inequality in §2.3.1 and §5.3.3 of this expository article [Con05].. Under GRH, (35) can be improved to
(36) |
for any (see [DM24, Lemma 1]), but this yields no advantage over (34) in our setting. Using (35) Özlük and Snyder showed in their earlier work [OS93] that the support for the one-level density can be taken as . Using (34) Rubinstein [Rub01] extended the support for the -level density to for all . The key idea that allowed Özlük and Snyder to go beyond this range in [OS99] is applying the Poisson summation formula to a smoothed character sum.
We mimick the proof of Theorem 4 to obtain the proportion . Denote by the number of fundamental discriminants with . It is well known that . Applying (14) to and averaging over the set of ’s, we find that
By the Cauchy–Schwarz inequality and Jutila’s result (34), the sum over primes contributes
(37) |
while the sum over squares of primes is
Hence we have
by choosing for some suitable . It follows that for at most of the ’s with since is always even.
By combining the preceding argument with the proof of Theorem 6 one can deduce that
(38) |
The task is to maximize subject to the condition that for all large ,
(39) |
where . We find by numerical computation that can be taken as large as when .
5.2. Low-lying zeros of for localized ’s
It is worth pointing out that (35) has the advantage that the shape of the estimate stays unchanged if we sum over an arbitrary interval of the same length, whereas it is not clear from the proofs of (34) and (36) how to remove the dependency on the initial interval. As a consequence, for we have
This observation can be useful when we average only over those ’s with close to . For example, since in (39) the largest value of is achieved when , this implies that in (38) we can shorten the interval in which the maximum occurs to where . Working with (which satisfies ) instead in (39) and taking and , we see that there must exist some such that . In general, for each one can compute an upper bound for the length of the shortest interval in which there exists some with . In particular, and as mentioned above. For intermediate one can work with (see (29)) for the optimal choice of .
In the opposite direction, we find by applying this argument to that
Of course this bound is not optimal for close to 1.
5.3. Proportion of ’s having small zeros
We now discuss an analogue of Theorem 7 for quadratic Dirichlet -functions by modifying the argument in §4.6. Denote by the number of fundamental discriminants in , and for let . Further let and suppose that . We then proceed with a Cauchy–Schwarz argument as before. On the one hand, by the positivity trick we have
where the second term on the penultimate line corresponds to the sum over squares of primes, while the contribution from primes is negligible (see (37)). Note, however, that the right-hand side needs to be non-negative in order to keep the inequality valid upon squaring both sides. That is, we need .
On the other hand,
where denotes the sum over and . Since , it follows from the work of Gao [Gao14] on the -level density (here we only need the special case ) that
(40) |
(plug into formula (3.13) in [Gao14, §3.6] 777Technically we need for some absolute constant in order for (40) to hold, but this has no bearing on our discussion.). Roughly speaking, only the contribution from the diagonal terms matters. Thus
The two required conditions and (so that ) can be simultaneously satisfied if and only if . Now we collect the previous estimates and reach the following conclusion:
Theorem 14.
Assume GRH. For ,
(41) |
Unfortunately we are not able to find a closed form expression for the right-hand side.

6. Explicit estimates on
It might be of interest to establish some effective results for the low-lying zeros of . All the numerical computations in this section are carried out on Mathematica. One natural question to ask is: for a given real number , what is the least conductor such that for all ? If , the following estimate on the zero-counting function obtained by Bennet et al. provides an unconditional upper bound on :
Theorem 15 ([Ben+21, Theorem 1.1]).
Let be a character with conductor . If and , then
where counts the number of zeros of with and .
Take for example. As noted on [Ben+21, pp. 1458], it follows from Theorem 15 that , or , when . Assuming GRH, we can substantially reduce this number by employing the positivity technique. Indeed, we find that for ,
for all . (The choice of is nearly optimal.) Thus for all and . As explained in §2, if , then the sum over zeros must be negative for , from which we conclude that when . Similarly, for , choosing gives for .
Next we derive an effective upper bound on in terms of based on the proof of Theorem 1.
Theorem 16.
Assume GRH. For all ,
Proof.
We claim that for ,
(42) |
which are explicit versions of Lemmas 9 and 10, respectively. Indeed, recall from the proof of Lemma 9 that
for some . It is not hard to show that on . Moreover, the integral converges to as , and for any the average of the function on is bounded by its global maximum . This proves the first assertion. The second assertion follows from (2.4) and the bound due to Rosser and Schoenfeld [RS62, Theorem 12].
Now set with , which is since . We then deduce from (42) that
and consequently
Using the fact that for and the inequality for , a quick calculation shows that for . For smaller we verify this computationally, thereby completing the proof. ∎
7. Extensions of Theorems 1–3 to general -functions
We conclude by reformulating Theorems 1, 2 and 3 in the more general context. We impose the same assumptions on , the -function under consideration, as in [CCM15, §4]. Suppose that it has an Euler product of the form
where
for some constant . Define the completed -function by
with , and , such that it satisfies the functional equation
Suppose further that has poles at with , so that by the functional equation it has the same number of poles at . The analytic conductor of is given by
Let be an admissible function. Mestre [Mes86, §I.2] established the explicit formula
(43) |
where the sum runs over zeros of with real part , is from (13), and
Let (resp., ) and denote the height of the lowest (resp., lowest non-real) non-trivial zero of and its order of vanishing at , respectively. Assuming RH for , we apply (43) to , and as defined in (16), (23) and (24), respectively, and follow the same lines of argument as in §2 and §3. First, we can prove that
and the last two terms in (43) are both
By modifying the proof of Theorem 1, we find that
Next, for we see that the second, third, and last two terms on the right-hand side of (43) are all , and the third term is . Hence
Lastly, similar estimates for imply that
in conjunction with the preceding bound on .
8. Acknowledgment
I would like to thank my advisor Ghaith Hiary for his comments and suggestions.
References
- [Arm99] M. V. Armon “Averages of Real Character Sums” In J. Number Theory 77(2), 1999, pp. 209–226
- [Ayo63] R. G. Ayoub “An introduction to the analytic theory of numbers”, Math. Surveys, No. 10 Amer. Math. Soc., Providence, R.I., 1963
- [Bar81] K. Barner “Weil’s explicit formula” In J. reine angew. Math. 323, 1981, pp. 139–152
- [Ben+21] M. A. Bennett, G. Martin, K. O’Bryant and A. Rechnitzer “Counting zeros of Dirichlet -functions” In Math. Comp. 90(329), 2021, pp. 1455–1482
- [Bui12] H. M. Bui “Non-vanishing of Dirichlet -functions at the central point” In Int. J. Number Theory 8(8), 2012, pp. 1855–1881
- [CCM15] E. Carneiro, V. Chandee and M. B. Milinovich “A note on the zeros of zeta and -functions” In Math. Z. 281 (1-2), 2015, pp. 315–332
- [CCM22] E. Carneiro, A. Chirre and M. B. Milinovich “Hilbert spaces and low-lying zeros of -functions” In Adv. Math. 410 (108748), 2022
- [Cho65] S. Chowla “The Riemann Hypothesis and Hilbert’s Tenth Problem” In Mathematics and Its Applications 4 GordonBreach Science Publishers, New York, 1965
- [Con05] B. Conrey “Families of -functions and 1-level densities” In Recent perspectives in random matrix theory and number theory, London Math. Soc. Lecture Note Ser. Cambridge University Press, Cambridge, 2005, pp. 225–249
- [DM24] P. Darbar and G. Maiti “Large values of quadratic Dirichlet -functions” Preprint, https://arxiv.org/abs/2406.01519, 2024
- [DPR23] S. Drappeau, K. Pratt and M. Radziwiłł “One-level density estimates for Dirichlet L-functions with extended support” In Algebra Number Theory 17(4), 2023, pp. 805–830
- [FM13] D. Fiorilli and G. Martin “Inequities in the Shanks–Rényi prime number race: An asymptotic formula for the densities” In J. reine angew. Math. 676, 2013, pp. 121–212
- [Gao14] P. Gao “-level density of the low-lying zeros of quadratic Dirichlet -functions” In Int. Math. Res. Notices 6, 2014, pp. 1699–1728
- [HR03] C. P. Hughes and Z. Rudnick “Linear statistics of low-lying zeros of -functions” In Q. J. Math. 54(3), 2003, pp. 309–333
- [IK04] H. Iwaniec and E. Kowalski “Analytic Number Theory”, AMS Colloquium Publications, Vol. 53, 2004
- [Jut73] M. Jutila “On character sums and class numbers” In J. Number Theory 5, 1973, pp. 203–214
- [KS99] N. M. Katz and P. Sarnak “Zeroes of zeta functions and symmetry” In Bull. Amer. Math. Soc. (N. S.) 36(1), 1999, pp. 1–26
- [KMN22] R. Khan, D. Milićevié and H. T. Ngo “Nonvanishing of Dirichlet -functions, II” In Math. Z. 300(2), 2022, pp. 1603–1613
- [Mes86] J.-F. Mestre “Formules explicites et minorations de conducteurs de variétés algébriques” In Compositio Math. 58(2), 1986, pp. 209–232
- [Mil02] S. D. Miller “The highest lowest zero and other applications of positivity” In Duke Math. J. 112(1), 2002, pp. 83–116
- [MV73] H. L. Montgomery and R. C. Vaughan “The large sieve” In Mathematika 20, 1973, pp. 119–134
- [MV07] H. L. Montgomery and R. C. Vaughan “Multiplicative Number Theory I. Classical Theory”, Cambridge Studies in Advanced Mathematics 97 Cambridge University Press, Cambridge, 2007
- [Mur90] M. R. Murty “On simple zeros of certain -series” In Number Theory (Banff, AB, 1988) de Gruyter, Berlin, 1990, pp. 427–439
- [Odl90] A. M. Odlyzko “Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions: A survey of recent results” In Sém. Théor. Nombres Bordeaux (2) 2(1), 1990, pp. 119–141
- [Oma00] S. Omar “Majoration du premier zéro de la fonction zêta de Dedekind” In Acta Arith. 99 (1), 2000, pp. 61–65
- [Oma08] S. Omar “Non-vanishing of Dirichlet -functions at the central point” In Algorithmic number theory, Lecture Notes in Comput. Sci. 5011 Springer, Berlin, 2008, pp. 443–453
- [Oma14] S. Omar “On small zeros of automorphic -functions” In C. R. Math. Acad. Sci. Paris 352 (7-8), 2014, pp. 551–556
- [OS93] A. E. Özlük and C. Snyder “Small zeros of quadratic -functions” In Bull. Austral. Math. Soc. 47(2), 1993, pp. 307–319
- [OS99] A. E. Özlük and C. Snyder “On the distribution of the nontrivial zeros of quadratic -functions close to the real axis” In Acta Arith. 91(3), 1999, pp. 209–228
- [Poi77] G. Poitou “Sur les petits discriminants” In Séminaire Delange-Pisot-Poitou, 18e année: 1976/77, Théorie des nombres, Fasc. 1 Paris: Secrétariat Math., 1977, pp. 1–17
- [Pra19] K. Pratt “Average non-vanishing of Dirichlet -functions at the central point” In Algebra Number Theory 13(1), 2019, pp. 227–249
- [RS62] J. Rosser and L. Schoenfeld. “Approximate formulas for some functions of prime numbers” In Illinois J. Math. 6(1), 1962, pp. 64–94
- [Rub01] M. Rubinstein “Low-lying zeros of -functions and random matrix theory” In Duke Math. J. 109(1), 2001, pp. 147–181
- [Sel46] A. Selberg “Contributions to the theory of Dirichlet’s -functions” In Skr. Norske Vid.-Akad. Oslo I 3, 1946
- [Sie45] C. L. Siegel “On the zeros of the Dirichlet -functions” In Ann. of Math 46 (3), 1945, pp. 409–422
- [Sou00] K. Soundararajan “Nonvanishing of quadratic Dirichlet -functions at ” In Ann. of Math. (2) 152(2), 2000, pp. 447–488
- [Vaa85] J. D. Vaaler “Some extremal functions in Fourier analysis” In Bull. Amer. Math. Soc. 12(2), 1985, pp. 183–216