Correlation of arithmetic functions over
arXiv:1811.04834 · doi:10.1007/s00208-019-01929-x
Abstract
For a fixed polynomial , we study the number of polynomials of degree over such that and are both irreducible, an -analogue of the twin primes problem. In the large- limit, we obtain a lower-order term for this count if we consider non-monic polynomials, which depends on in a manner which is consistent with the Hardy-Littlewood Conjecture. We obtain a saving of if we consider monic polynomials only and is a scalar. To do this, we use symmetries of the problem to get for free a small amount of averaging in . This allows us to obtain additional saving from equidistribution results for -functions. We do all this in a combinatorial framework that applies to more general arithmetic functions than the indicator function of irreducibles, including the Möbius function and divisor functions.
arXiv commentIncorporated referee comments. Accepted for publication in Math. Annalen
References in corpus (10)
- Shifted convolution and the Titchmarsh divisor problem over F_q[t]
- Arithmetic functions in short intervals and the symmetric group
- The autocorrelation of the Möbius function and Chowla's conjecture for the rational function field in characteristic 2
- On quantitative analogues of the Goldbach and twin prime conjectures over F_q[t]
- Higher moments of arithmetic functions in short intervals: a geometric perspective
- The equidistribution of L-functions of twists by Witt vector Dirichlet characters over function fields
- A representation theory approach to integral moments of L-functions over function fields
- On the Chowla and twin primes conjectures over
- Square-root cancellation for sums of factorization functions over short intervals in function fields
- Cubic twin prime polynomials are counted by a modular form