Zeros of the Epstein zeta function to the right of the critical line
Youness Lamzouri

TL;DR
This paper improves the asymptotic count of zeros of Epstein zeta functions to the right of the critical line, refining previous estimates by reducing the error term's growth rate.
Contribution
It provides a sharper asymptotic formula for the number of zeros of Epstein zeta functions in certain regions, enhancing prior results by Gonek and Lee.
Findings
Enhanced asymptotic formula for zero counts
Reduced the error term's dependence on log T
Extended understanding of zeros distribution for Epstein zeta functions
Abstract
Let be the Epstein zeta function attached to a positive definite quadratic form of discriminant , such that , where is the class number of the imaginary quadratic field . We denote by the number of zeros of in the rectangle and , where are fixed real numbers. In this paper, we improve the asymptotic formula of Gonek and Lee for , obtaining a saving of a power of in the error term.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Zeros of the Epstein zeta function to the right of the critical line
Youness Lamzouri
Institut Élie Cartan de Lorraine, Université de Lorraine, BP 70239, 54506 Vandoeuvre-lès-Nancy Cedex, France; and Department of Mathematics and Statistics, York University, 4700 Keele Street, Toronto, ON, M3J1P3 Canada
Abstract.
Let be the Epstein zeta function attached to a positive definite quadratic form of discriminant , such that , where is the class number of the imaginary quadratic field . We denote by the number of zeros of in the rectangle and , where are fixed real numbers. In this paper, we improve the asymptotic formula of Gonek and Lee for , obtaining a saving of a power of in the error term.
2010 Mathematics Subject Classification:
Primary 11E45, 11M41.
The author is partially supported by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada.
1. Introduction
The Epstein zeta functions are zeta functions associated to quadratic forms, that were introduced by Epstein [4] in the early 1900’s as generalizations of the classical Riemann zeta function. These functions are interesting analytic objects, which also have applications in algebraic number theory and the theory of modular forms. In this paper, we will only be concerned about Epstein zeta functions attached to binary quadratic forms. Let be a positive definite quadratic form with , , and discriminant . The Epstein zeta function associated to is defined for by
[TABLE]
It extends to a meromorphic function on with a simple pole at , and satisfies the functional equation
[TABLE]
This follows from the relation between and the Eisenstein series , defined for (where is the upper-half plane) and by
[TABLE]
Indeed, one has
[TABLE]
where . The functional equation (1.1) is then obtained from the analogous functional equation for , which is easily derived since the Eisenstein series is a modular form.
Epstein zeta functions are also interesting from an arithmetic point of view, since they are related to the Dedekind zeta function of the imaginary quadratic field Indeed, we have
[TABLE]
where the sum runs over a full set of inequivalent quadratic forms of discriminant , and is the number of roots of unity in , that is
[TABLE]
The distribution of zeros of depends on the value of the class number of the imaginary quadratic field . Indeed, if (which occurs only when and ), then . In particular, has an Euler product, and is expected to satisfy an analogue of the Riemann hypothesis. However, if , the distribution of zeros of is completely different. In this case, Davenport and Heilbronn [3] proved that has infinitely many zeros in the half-plane . The main reason for this difference is the fact that when , is a linear combination of two or more inequivalent -functions. More precisely, one has
[TABLE]
where is a sum over all characters of the class group of , is a representative of the ideal class corresponding to the equivalence class of , and is the Hecke -function attached to , which is defined for by
[TABLE]
where and denote integer and prime ideals of respectively, and is the norm of the ideal . This follows since equivalence classes of quadratic forms of discriminant are in one-to-one correspondence with ideal classes of , and the number of representations of a number by a quadratic form is the number of integer ideals of norm in the corresponding ideal class, times the number of roots of unity in . Moreover, it is known (see for example the discussion on page 303 of [5]) that if is complex, then Let be the number of real characters plus one half the number of complex characters of the class group of , and list these characters as where and , for all . Hence, one can write
[TABLE]
where for are inequivalent Hecke -functions, and
[TABLE]
When , it was conjectured by Montgomery that almost all complex zeros of lie on the critical line . This conjecture was proved by Bombieri and Hejhal [1] conditionally on the Generalized Riemann Hypothesis and a weak version of a pair correlation conjecture.
For let
[TABLE]
Using a universality result for Hecke -functions, Voronin [10] proved that if then for fixed, we have
[TABLE]
where the implicit constant depends on and . Lee [7] improved this result to an asymptotic formula
[TABLE]
where for . More recently, building on the work of Lamzouri, Lester and Radziwill [6] for the distribution of -points of the Riemann zeta function, Gonek and Lee [5] obtained a non-trivial upper bound for the error term in (1.4). More precisely, they showed that if and are fixed, then we have
[TABLE]
for some absolute constant . Using the same method, Lee [8] improved this asymptotic formula, obtaining a saving of a power of in the error term, in the special case where is a linear combination of exactly two inequivalent -functions, which corresponds to or . More precisely, he showed that in this case
[TABLE]
However, when , is a linear combination of three or more inequivalent -functions, and in this case, the method of Gonek and Lee only yields the weaker error term .
In this note, we use a different and more streamlined method to improve the error term in the asymptotic formula (1.5). Our approach relies on a geometric box covering argument in , and gives a saving of a power of in the error term of (1.5) when .
Theorem 1.1**.**
Let be a positive definite quadratic form with , , and discriminant , such that . Let be fixed. Then, we have
[TABLE]
where
Remark 1.2**.**
The proof of Theorem 1.1 gives a quantitative estimate for the term in the RHS of (1.6). More precisely, it follows that the error term in the asymptotic formula (1.6) is , for some constant .
2. Strategy of proof of Theorem 1.1 and key ingredients
Let be fixed real numbers, and be large. To count the number of zeros of in the rectangle , we shall use Littlewood’s lemma in a standard way. Let denote a zero of . It is known that there exists such that for all zeros of . By Littlewood’s lemma (see equation (9.9.1) of Titchmarsh [9]), we have
[TABLE]
In order to estimate the integrals on the right hand side of this asymptotic formula, we shall construct a probabilistic random model for . This was also used in [5], [7] and [8]. Recall from (1.2) that
[TABLE]
Let be a sequence of independent random variables, indexed by the prime numbers, and uniformly distributed on the unit circle. For we consider the random Euler products
[TABLE]
where is the unique rational prime dividing . These random products converge almost surely for by Kolmogorov’s three series Theorem. We shall prove that is very close to the expectation (which we shall denote throughout by ) of , where the probabilistic random model is defined by
[TABLE]
Theorem 2.1**.**
Let be fixed. There exists a constant such that
[TABLE]
Gonek and Lee [5] obtained such an asymptotic formula, but with the weaker error term .
We now show how to deduce Theorem 1.1 from Theorem 2.1 and (2.1). The proof also provides an explicit description of the constant in terms of the probabilistic random model .
Proof of Theorem 1.1.
Let
[TABLE]
Lee [7] proved that is twice differentiable as a function of . Let be small. Combining Theorem 2.1 with the estimate (2.1) at and , we obtain
[TABLE]
Dividing by both sides, and using that is twice differentiable gives
[TABLE]
Therefore,
[TABLE]
We substitute for , and use that (since is differentiable) to get
[TABLE]
We pick to conclude that
[TABLE]
Thus, using this estimate with and gives
[TABLE]
where
[TABLE]
∎
Our proof of Theorem 2.1 (which will be given in the next section) uses a different approach, but relies on the same key ingredients as in [5]. The first is a discrepancy bound for the joint distribution of the Hecke -functions . For let
[TABLE]
and similarly define the random vector
[TABLE]
Then we have the following result, which is essentially proved by Gonek and Lee [5], and is a generalization of Theorem 1.1 of [6]. Its proof is a slight modification of the proof of Theorem 1.2 of [5], so we omit it. Here and throughout we let “meas” denotes the Lebesgue measure on .
Theorem 2.2**.**
Let be fixed. The we have
[TABLE]
where the supremum is taken over all rectangular boxes (possibly unbounded) , with sides parallel to the coordinate axes.
We shall use this result to approximate the integral by the expectation . However, in doing so we need to control the large values and the logarithmic singularities of both and . To this end we use the following lemmas, which are proved in [5].
Lemma 2.3** (Lemma 3.1 of [5]).**
Let be fixed. There exists a constant depending at most on , such that for every positive integer we have
[TABLE]
Lemma 2.4** (Lemma 3.2 of [5]).**
Let be fixed, and . There exist positive constants depending on , such that for every positive integer we have
[TABLE]
Lemma 2.5** (Lemma 3.3 of [5]).**
Let be fixed. There exists a constant depending at most on , such that for every positive integer we have
[TABLE]
and for all
[TABLE]
3. Proof of Theorem 2.1
We start by showing how to use Lemmas 2.3 and 2.4 to control the large values and the logarithmic singularities of . Let be a suitably large constant and put . We consider the following sets
[TABLE]
[TABLE]
Let . Then, it follows from Lemma 2.4 that
[TABLE]
if is suitably large. On the other hand, using Lemma 2.3 with the same choice of gives
[TABLE]
Therefore we deduce
[TABLE]
Combining this bound with Lemma 2.3, and using Hölder’s inequality with we get
[TABLE]
We now define for
[TABLE]
and similarly
[TABLE]
where is the event and . We shall deduce Theorem 2.1 from the following result which shows that is very close to uniformly in .
Proposition 3.1**.**
For large, we have
[TABLE]
Proof.
We let , be a small parameter to be chosen later. We shall consider three cases depending on the size of .
Case 1: In this case, it follows from the definitions of the set and the event that
[TABLE]
and
[TABLE]
and hence the desired estimate follows from Theorem 2.2.
Case 2:
In this case we have
[TABLE]
where is the bounded subset of defined by
[TABLE]
We cover with hypercubes (of dimension ) with non-empty intersection with , and with sides of length . The number of such hypercubes is
[TABLE]
Now, let and (recall that this intersection is non-empty by construction). Then, for any we have and for all . Hence, we deduce that for all and
[TABLE]
for some positive constant since by our assumption. Therefore, we have shown that
[TABLE]
By Theorem 2.2 we thus deduce that
[TABLE]
Moreover, it follows from the work of Borchsenius and Jessen [2] (see for example page 315 of [5]) that is an absolutely continuous random variable. This shows that
[TABLE]
Combining this bound with (3.3) and (3.5) gives
[TABLE]
Similarly, it follows from (3.6) that
[TABLE]
The desired bound on the discrepancy then follows from Theorem 2.2 by choosing .
Case 3:
In this case we have
[TABLE]
where is the bounded subset of defined by
[TABLE]
Similarly as before, we cover with hypercubes with non-empty intersection with , and with sides of length . The number of such hypercubes is
[TABLE]
Now, let and . Then, for any we have and for all . Hence, we deduce that for all and
[TABLE]
if is sufficiently large, since by our assumption. Therefore, we have shown that
[TABLE]
Thus, it follows from Theorem 2.2 that
[TABLE]
where in the last estimate we have used that
[TABLE]
since is an absolutely continuous random variable. Now, by Lemma 2.5 we have
[TABLE]
if is suitably large. Thus, we have shown that
[TABLE]
We now proceed to prove the corresponding lower bound. Let be such that . Then, it follows from (3.8) and Theorem 2.2 that
[TABLE]
Moreover, by (3.1) we have
[TABLE]
Finally, we use that is an absolutely continuous random variable to deduce that
[TABLE]
Inserting these estimates in (3.11) yields
[TABLE]
The desired result follows by combining (3.10) and (3.12) and choosing .
∎
Proof of Theorem 2.1.
We consider the following integral
[TABLE]
where the last equality follows since for all we have and hence if is suitably large. Combining this identity with (3.2) and using that we obtain
[TABLE]
We now repeat the exact same argument but with the random model instead of the Epstein zeta function. Using the same argument leading to (3.2) but with Lemma 2.5 instead of Lemmas 2.3 and 2.4, we deduce similarly that
[TABLE]
where is the indicator function of . Therefore, reproducing the argument leading to (3.13) we obtain
[TABLE]
Finally, it follows from Proposition 3.1 that
[TABLE]
Combining this bound with (3.13) and (3.14) completes the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Bombieri and D. Hejhal, On the distribution of zeros of linear combinations of Euler products. Duke Math. J. 80 (1995), 821–862.
- 2[2] V. Borchsenius and B. Jessen, Mean motions and values of the Riemann zeta function. Acta Math. 80 (1948), 97–166.
- 3[3] H. Davenport and H. Heilbronn, On the zeros of certain Dirichlet series. J. Lond. Math. Soc. 11 (1936), 181–185, 307–312.
- 4[4] P. Epstein, Zur Theorie allgemeiner Zetafunctionen. Math. Ann., 56, 615–644 (1903).
- 5[5] S. Gonek and Y. Lee, Zero-density estimates for Epstein zeta functions. Q. J. Math. 68 (2017), no. 2, 301–344.
- 6[6] Y. Lamzouri, S. Lester, and M. Radziwill, Discrepancy bounds for the distribution of the Riemann zeta-function and applications. J. Anal, Math., to appear.
- 7[7] Y. Lee, On the zeros of Epstein zeta functions. Forum Math 26 (2014), 1807–1836.
- 8[8] Y. Lee, Zero-density estimates for Epstein zeta functions of class numbers 2 or 3. J. Korean Math. Soc. 54 (2017), no. 2, 479–491.
