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

2016/02/05 by Harper, Adam J., Soundararajan, Kannan
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1602.01984

Abstract

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod q, summed over all q ≤ Q, 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 (1-ε) QNlog(Q²/N) for the variance of the von Mangoldt function (Λ(n))_n=1^N, on the range √(N) (log N)^C ≤ Q ≤ N. Previously such a result was only available assuming the Riemann Hypothesis. We also prove a lower bound ≫_k,δ Q N (log N)^{k2 - 1} for the variance of the divisor functions d_k(n), valid on the range N^1/2+δ ≤ Q ≤ N, for any natural number k ≥ 2.

Related

• A lower bound for the variance in arithmetic progressions of some\n multiplicative functions close to 1
• A lower bound for the variance of generalized divisor functions in\n arithmetic progressions
• Sparser variance for primes in arithmetic progression
• Variance of sums in arithmetic progressions of arithmetic functions associated with higher degree L-functions in \mathbbF_q[t]
• The distribution of the variance of primes in arithmetic progressions