本文证明了，若$k\ge2$是固定整数，且$1 \ll H \le X/2$，则$$ \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), $$，其中$Δ_k(x)$是一般Dirichlet除数问题的误差项.证明中使用了$Δ_k(x)$的Vorono{\"N}-型公式，以及当四个$k$的根之差很小时，整数个数的Robert-Sargos界.我们还研究了$Δ_2(x)$的$m$阶矩渐近公式中误差项的大小。
英文摘要：
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)$.
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.
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.
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.
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 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.
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.
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 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.
We prove an asymptotic formula for the shifted convolution of the divisor functions $d_k(n)$ and $d(n)$ with $k \geq 4$, which is uniform in the shift parameter and which has a power-saving error term, improving results obtained previously by Fouvry and Tenenbaum and, more recently, by Drappeau.
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 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.
We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates for the shifted convolution of $d_3(n)$ and Fourier coefficents of holomorphic cusp forms. These asymptotics improve previous results obtained by several different authors.
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（格勒诺布尔阿尔卑斯大学傅里叶研究所）
