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 , summed over all , 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 for the variance of the von Mangoldt function , on the range . Previously such a result was only available assuming the Riemann Hypothesis. We also prove a lower bound for the variance of the divisor functions , valid on the range , for any natural number .
Recommendations
- A lower bound for the variance of generalized divisor functions in arithmetic progressions
- On a variance associated with the distribution of general sequences in arithmetic progressions. I
- Sparser variance for primes in arithmetic progression
- The variance of divisor sums in arithmetic progressions
- On a variance associated with the distribution of primes in arithmetic progressions.
Cited in
(10)- The variance of divisor sums in arithmetic progressions
- The variance of the number of sums of two squares in \(\mathbb{F}_q[T]\) in short intervals
- Variance of the $k$-fold divisor function in arithmetic progressions for individual modulus
- Generalized divisor functions in arithmetic progressions. I
- Disproving Hooley's conjecture
- Moments of moments of primes in arithmetic progressions
- Variance of sums in arithmetic progressions of divisor functions associated with higher degree L-functions in 𝔽q[t]
- A lower bound for the variance of generalized divisor functions in arithmetic progressions
- Correlations of multiplicative functions in function fields
- Generalized divisor functions in arithmetic progressions: II
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)