Let $Δ(x)$ denote the error term in the Dirichlet divisor problem. Our main results are the asymptotic formulas $$ \int_1^X Δ^3(x){\rm d}x = BX^{7/4} + O_ε(X^{β+ε}) \qquad(B > 0) $$ and $$ \int_1^X Δ^4(x){\rm d}x = CX^2 + O_ε(X^{γ+ε}) \qquad(C > 0) $$ with $β= 7/5, γ= 23/12$. This improves on the values $β= 47/28, γ= 45/23$, due to K.-M. Tsang. A result on the integrals of $Δ^3(x)$ and $Δ^4(x)$ in short intervals is also proved.
This is part II of our examination of the second and fourth moments and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations.
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise input of the conjectural formula for the classical shifted convolution problem for divisor sums so as to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^2$ with divisor functions as coefficients.
We examine the calculation of the second and fourth moments and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. Previously this approach has proved unsuccessful in computing moments beyond the eighth, even heuristically. A careful analysis of the second and fourth moments illustrates the nature of the problem and enables us to identify the terms that are missed in the standard application of these methods.
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper begins the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^3$ with divisor functions as coefficients.
Suppose $a$ and $b$ are two fixed positive integers such that $(a,b)=1.$ In this paper we shall establish an asymptotic formula for the mean square of the error term $Δ_{a,b}(x)$ of the general two-dimensional divisor problem.
In this series of papers we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper completes the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of arbitrary length with divisor functions as coefficients.
Let $Δ(a,b;x)$ denote the error term of the general two-dimensional divisor problem. In this paper we shall study the relation between the discrete mean value $\sum_{n\leq T}Δ^2(a,b;n)$ and the continuous mean value $\int_1^TΔ^2(a,b;x)dx$.
We refine a recent heuristic developed by Keating and the second author. Our improvement leads to a new integral expression for the conjectured asymptotic formula for shifted moments of the Riemann zeta-function. This expression is analogous to a formula, recently discovered by Brad Rodgers and Kannan Soundararajan, for moments of characteristic polynomials of random matrices from the unitary group.
Several results are obtained concerning the function $Δ_k(x)$, which represents the error term in the general Dirichlet divisor problem. These include the estimates for the integral of this function, as well as for the corresponding mean square integral. The mean square integral of $Δ_2(x)$ is investigated in detail.
Let $τ(n)$ be the number of divisors of $n$. We give an elementary proof of the fact that $$ \sum_{n\le x} τ(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}), $$ for any integer $r\ge 2$. Here, $$ C_{r}=\frac{1}{(2^r-1)!} \prod_{p\ge 2}\left( \left(1-\frac{1}{p}\right)^{2^r} \left(\sum_{α\ge 0} \frac{(α+1)^r}{p^α}\right)\right). $$
We obtain asymptotic for the quantity $\int_0^1 \bigg|\sum_{n\le X}τ_k(n)e(nα)\bigg|dα$ where $τ_k(n) = \sum_{d_1\dots d_k = n} 1$. This follows from a quick application of the circle method. Along the way, we find minor arc bounds for the exponential sum with $τ_k$, and asymptotics for high moments of the Dirichlet kernel.
Hardy and Littlewood initiated the study of the $2k$-th moments of the Riemann zeta function on the critical line. In 1918 Hardy and Littlewood established an asymptotic formula for the second moment and in 1926 Ingham established an asymptotic formula for the fourth moment. Since then no other moments have been asymptotically evaluated. In this article we study the sixth moment of the zeta function on the critical line. We show that a conjectural formula for a certain family of ternary additive divisor sums implies an asymptotic formula with power savings error term for the sixth moment of th…
We deeply appreciate the papers of Ivić on the links between the $2k-$th moments of the Riemann zeta function and, say, $d_k$, the $k-$divisor function. More specifically, both the one bounding the $2k-$th moment with a simple average of correlations of the $d_k$ (Palanga 1996 Conference Proceedings) and the more recent (arXiv:0708.1601v2 to appear on JTNB), which bounds the Selberg integral of $d_k$ applying the $2k-$th moment of the zeta. Building on the former paper, we apply an elementary approach (based on arithmetic averages) in order to get information on the reverse link to the second …
We compute the first and second moments of the divisor-counting function for the Euler-Poincaré characteristic and the trace of Frobenius for the reductions modulo $p$ of a rank 2 Drinfeld module with nontrivial endomorphism ring, as the prime $p$ varies over the primes of ordinary reduction of the Drinfeld module. From these moments we derive the normal order of the number of prime divisors of these invariants.
It is proved that, if $k\ge2$ is a fixed integer and $1 \ll H \le X/2$, then $$ \int_{X-H}^{X+H}Δ^4_k(x)\d x \ll_εX^ε\Bigl(HX^{(2k-2)/k} + H^{(2k-3)/(2k+1)}X^{(8k-8)/(2k+1)}\Bigr), $$ where $Δ_k(x)$ is the error term in the general Dirichlet divisor problem. The proof uses the Vorono{\"ı}--type formula for $Δ_k(x)$, and the bound of Robert--Sargos for the number of integers when the difference of four $k$--th roots is small. We also investigate the size of the error term in the asymptotic formula for the $m$-th moment of $Δ_2(x)$.
We estimate asymptotically the fourth moment of the Riemann zeta-function twisted by a Dirichlet polynomial of length $T^{\frac14 - \varepsilon}$. Our work relies crucially on Watt's theorem on averages of Kloosterman fractions. In the context of the twisted fourth moment, Watt's result is an optimal replacement for Selberg's eigenvalue conjecture. Our work extends the previous result of Hughes and Young, where Dirichlet polynomials of length $T^{\frac{1}{11}-\varepsilon}$ were considered. Our result has several applications, among others to the proportion of critical zeros of the Riemann zeta…
Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in the representation of the number as a sum of a prime and two squares, and to Fourier coefficients of cusp forms, generalizing a result of Pitt.
In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Voronoï's formula concerning the error term in the Dirichlet divisor problem.
Let $\ba=(a_1,a_2,\ldots,a_k)$, where $a_j \ (j=1,\ldots,k)$ are positive integers such that $a_1 \leq a_2 \leq \cdots \leq a_k$. Let $d(\ba;n)=\sum_{n_1^{a_1}\cdots n_k^{a_k}=n}1$ and $Δ(\ba;x)$ be the error term of the summatory function of $d(\ba;n)$. In this paper we show an asymptotic formula of the mean square of $Δ(\ba;x)$ under a certain condition. Furthermore, in the cases $k=2$ and 3, we give unconditional asymptotic formulas for these mean squares.
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2πmθ_1)\sin(2πnθ_2)$, where $θ_i (0<θ_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions, we establish the upper bound, mean-value, mean-square and some power-moments.
For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with explicit error terms. We also present results for higher moments along with computational data which support the results for the second, third, fourth, and fifth moments. The analogous question for integers is studied by Diaconis and Erdös.
The purpose of this text is twofold. First we discuss some divisor problems involving Paul Erd\H os (1913-1996), whose centenary of birth is this year. In the second part some recent results on divisor problems are discussed, and their connection with the powers moments of $|ζ(\frac{1}{2}+it)|$ is pointed out. This is an extended version of the lecture given at the conference ERDOS100 in Budapest, July 1-5, 2013.
Let $Δ(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|ζ(1/2+it)|$. If $E^*(t) = E(t) - 2πΔ^*(t/2π)$ with $Δ^*(x) = -Δ(x) + 2Δ(2x) - {1\over2}Δ(4x)$, then we obtain the asymptotic formula $$ \int_0^T (E^*(t))^2 {\rm d} t = T^{4/3}P_3(\log T) + O_ε(T^{7/6+ε}), $$ where $P_3$ is a polynomial of degree three in $\log T$ with positive leading coefficient. The exponent 7/6 in the error term is the limit of the method.
In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi.
We present several new results involving $Δ(x+U)-Δ(x)$, where $U = o(x)$ and $$ Δ(x):=\sum_{n\le x}d(n)-x\log x-(2γ-1)x $$ is the error term in the classical Dirichlet divisor problem.
We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.
Let $Δ^{(k)}(x)$ denote the error term of the $k$-free divisor problem for $k\geq 2$. In this paper we establish an asymptotic formula of the integral $\int_1^T|Δ^{(k)}(x)|^2dx$ for each $k\geq 4.$
Let $Δ(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|ζ(1/2+it)|$. If $E^*(t) = E(t) - 2πΔ^*(t/(2π))$ with $Δ^*(x) = -Δ(x) + 2Δ(2x) - {1\over2}Δ(4x)$, then it is proved that $$ \int_0^T|E^*(t)|^3dt \ll_εT^{3/2+ε}, $$ which is (up to `$ε$' best possible) and $ζ(1/2+it) \ll_εt^{ρ/2+ε}$ if $E^*(t) \ll_εt^{ρ+ε}$.
First part of this paper was published in CEJM (2)(4) (2004), 1-15. It is proved now that $$ \int_0^T|E^*(t)|^5{\rm d}t \ll_εT^{2+ε}. $$ Here $$ E^*(t) = E(t) - 2πΔ^*(t/2π), Δ^*(x) = - Δ(x) +2Δ(2x) - {1\over2}Δ(4x), $$ where $E(t)$ is the error term in the mean square formula for $|ζ(1/2+it)|$ and $Δ(x)$ is the error term in the Dirichlet divisor problem. It is also shown how bounds for moments of $|E^*(t)|$ lead to bounds for moments of $|ζ(1/2+it)|$.
We obtain, for $T^ε\le U=U(T)\le T^{1/2-ε}$, asymptotic formulas for $$ \int_T^{2T}(E(t+U) - E(t))^2 dt,\quad \int_T^{2T}(Δ(t+U) - Δ(t))^2 dt, $$ where $Δ(x)$ is the error term in the classical divisor problem, and $E(T)$ is the error term in the mean square formula for $|ζ(1/2+it)|$. Upper bounds of the form $O_ε(T^{1+ε}U^2)$ for the above integrals with biquadrates instead of square are shown to hold for $T^{3/8} \le U =U(T) \ll T^{1/2}$. The connection between the moments of $E(t+U) - E(t)$ and $|ζ(1/2+it)|$ is also given. Generalizations to some other number-theoretic error terms are discu…
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results were averaged over all progression of a given modulus. The method uses a short divisor sum approximation for the von Mangoldt function, together with some new results for binary correlations of this divisor sum approximation in arithmetic progressions.
We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this function for many cases. Our proof uses the estimate of exponential sums. We also show uniform results for ideal counting function and relatively $r$-prime lattice points as one of applications.
Let $d(n;\ell_1,M_1,\ell_2,M_2)$ denote the number of factorizations $n=n_1n_2$, where each of the factors $n_i\in\mathbb{N}$ belongs to a prescribed congruence class $\ell_i\bmod M_i\,(i=1,2)$. Let $Δ(x;\ell_1,M_1,\ell_2,M_2)$ be the error term of the asymptotic formula of $\sum\limits_{n\leqslant x}d(n;\ell_1,M_1,\ell_2,M_2)$. In this paper, we establish an asymptotic formula of the fourth power moment of $Δ(M_1M_2x;\ell_1,M_1,\ell_2,M_2)$ and prove that \begin{equation*} \int_1^TΔ^4(M_1M_2x;\ell_1,M_1,\ell_2,M_2)\mathrm{d}x=\frac{1}{32π^4}C_4\Big(\frac{\ell_1}{M_1},\frac{\ell_2}{M_2}\Big) T…
We calculate the triple correlations for the truncated divisor sum $λ_{R}(n)$. The $λ_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $Λ(n)$ does or is conjectured to do. We also calculate the mixed (with a factor of $Λ(n)$) correlations. The results for the moments up to the third degree, and therefore the implications for the distribution of primes in short intervals, are the same as those we obtained (in the first paper with this title) by using the simpler approximation $Λ_{R}(n)$. However, when $λ_{R}(n)$ is used the error in the singular series app…
Let $Δ(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|ζ(1/2+it)|$. If $E^*(t) = E(t) - 2πΔ^*(t/2π)$ with $Δ^*(x) = -Δ(x) + 2Δ(2x) - {1\over2}Δ(4x)$ and we set $\int_0^T E^*(t) dt = 3πT/4 + R(T)$, then we obtain $$ R(T) = O_ε(T^{593/912+ε}), \int_0^TR^4(t) dt \ll_εT^{3+ε}, $$ and $$ \int_0^TR^2(t) dt = T^2P_3(\log T) + O_ε(T^{11/6+ε}), $$ where $P_3(y)$ is a cubic polynomial in $y$ with positive leading coefficient.
We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N α\le x} \mathfrak{t}_k(α)$, where $N$ stands for the norm of a complex number and $\mathfrak{t}_k$ is the $k$-dimensional divisor function on Gaussian integers.
Let $Δ(x)$ denote the error term in the classical Dirichlet divisor problem, and let the modified error term in the divisor problem be $Δ^*(x) = -Δ(x) + 2Δ(2x) - \frac{1}{2}Δ(4x)$. We show that $$ \int_T^{T+H}Δ^*\bigl(\frac{t}{2π}\bigr)|ζ(1/2+it)|^2dt \;\ll\; HT^{1/6}\log^{7/2}T \quad(T^{2/3+\varepsilon} \le H = H(T) \le T), $$ $$ \int_0^TΔ(t)|ζ(1/2+it)|^2dt \;\ll\; T^{9/8}(\log T)^{5/2},$$ and obtain asymptotic formulae for $$ \int_0^T{\Bigl(Δ^*\bigl(\frac{t}{2π}\bigr)\Bigr)}^2 |ζ(1/2+it)|^2dt,\quad \int_0^T{\Bigl(Δ^*\bigl(\frac{t}{2π}\bigr)\Bigr)}^3|ζ(1/2+it)|^2dt. $$ The importance of the $…
Erdős considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a generalisation stating that the gaps between primes $p$ for which there is no $\mathbb{Q}_p$-point on a random variety are Poisson distributed.
Indraprastha Institute of Information Technology（印度普拉斯坦萨信息技术学院）；Chennai Mathematical Institute（马德拉斯数学研究所）；Institut Fourier, Université Grenoble Alpes（格勒诺布尔阿尔卑斯大学傅里叶研究所）
We prove that $$ \int_1^XΔ(x)Δ_3(x)\,dx \ll X^{13/9}\log^{10/3}X, \quad \int_1^XΔ(x)Δ_4(x)\,dx \ll_\varepsilon X^{25/16+\varepsilon}, $$ where $Δ_k(x)$ is the error term in the asymptotic formula for the summatory function of $d_k(n)$, generated by $ζ^k(s)$ ($Δ_2(x) \equiv Δ(x)$). These bounds are sharper than the ones which follow by the Cauchy-Schwarz inequality and mean square results for $Δ_k(x)$. We also obtain the analogues of the above bounds when $\D(x)$ is replaced by $E(x)$, the error term in the mean square formula for $|ζ(1/2+it)|$.
We obtain asymptotics with a power saving error term for $\int_0^1|\sum_{n\le X} d(n)e(nα)|^sdα$ for $s < 2$, where $d(n) = \sum_{d | n} 1$ is the divisor function. We also obtain such asymptotics for $\int_0^1|\sum_{n\le X}λ_f(n)e(nα)|^sdα$ for all $s > 0$. Our proof an iterative method with repeated applications of Jutila's variant of the circle method and Voronoi summation.
We provide upper bounds for the mean square integral $$ \int_X^{2X}(Δ_k(x+h) - Δ_k(x))^2 dx \qquad(h = h(X)\gg1, h = o(x) {\roman{as}} X\to\infty) $$ where $h$ lies in a suitable range. For $k\ge2$ a fixed integer, $Δ_k(x)$ is the error term in the asymptotic formula for the summatory function of the divisor function $d_k(n)$, generated by $ζ^k(s)$.
