Sign changes of the error term in the Piltz divisor problem
Abstract
We study the function k(x):=Σn≤ x dk(n) - Ress=1 ( ζk(s) xs/s ), where k≥ 3 is an integer, dk(n) is the k-fold divisor function, and ζ(s) is the Riemann zeta-function. For a large parameter X, we show that if the Lindel\"of hypothesis is true, then there exist at least X1k(k-1)- disjoint subintervals of [X,2X], each of length X1-1k-, such that |k(x)| x12-12k for all x in the subinterval. If the Riemann hypothesis is true, then we can improve the length of the subintervals to X1-1k ( X)-k2-2. These results may be viewed as higher-degree analogues of theorems of Heath-Brown and Tsang, who studied the case k=2, and Cao, Tanigawa, and Zhai, who studied the case k=3. The first main ingredient of our proofs is a bound for the second moment of k(x+h)-k(x). We prove this bound using a method of Selberg and a general lemma due to Saffari and Vaughan. The second main ingredient is a bound for the fourth moment of k(x), which we obtain by combining a method of Tsang with a technique of Lester.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.