Lower bounds for the variance of sequences in arithmetic progressions: primes and divisor functions
DOI10.1093/QMATH/HAW005zbMATH Open1426.11103arXiv1602.01984OpenAlexW2963597598MaRDI QIDQ2987015FDOQ2987015
Authors: Adam J. Harper, Kannan Soundararajan
Publication date: 17 May 2017
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.01984
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.
Asymptotic results on arithmetic functions (11N37) Arithmetic progressions (11B25) Sequences (mod (m)) (11B50) Applications of the Hardy-Littlewood method (11P55)
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)