Lower bounds for the variance of sequences in arithmetic progressions: primes and divisor functions

From MaRDI portal
Publication:2987015




Abstract: We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod q, summed over all qleqQ, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand. As an application, we prove a lower bound of (1epsilon)QNlog(Q2/N) for the variance of the von Mangoldt function (Lambda(n))n=1N, on the range sqrtN(logN)CleqQleqN. Previously such a result was only available assuming the Riemann Hypothesis. We also prove a lower bound ggk,deltaQN(logN)k21 for the variance of the divisor functions dk(n), valid on the range N1/2+deltaleqQleqN, for any natural number kgeq2.









This page was built for publication: Lower bounds for the variance of sequences in arithmetic progressions: primes and divisor functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987015)