Arithmetic correlations over large finite fields
This paper investigates the analogs of some correlation problems for primes in the setting of polynomials over finite fields. Let \(q\) be an odd prime power, \(P_n\) and \(M_n\) the set of polynomials and of monic polynomials of degree \(n\) over \(F_q\), resp. For a polynomial \(f\) put \(\Lambda(f) = \text{deg}\, p\) if \(f\) is a power of an irreducible polynomial \(p\), and 0 otherwise. It is known that NEWLINE\[CARRIAGE_RETURNNEWLINE q^{-n} \sum_{f\in M_n} \Lambda(f) \Lambda(f+K) = 1 + E(K, n, q),CARRIAGE_RETURNNEWLINE\]NEWLINE where \(E(K, n, q) = O(q^{-1/2})\) for a nonvanishing \(K\). The main results of the paper give estimates of the average of this error term \(E\) in the form NEWLINE\[CARRIAGE_RETURNNEWLINE \sum_{K\in M_k} E(K, n, q) = \frac{1}{1-q} + O(q^{-3/2}) CARRIAGE_RETURNNEWLINE\]NEWLINE for \(k<n-3\), and of a twisted average NEWLINE\[CARRIAGE_RETURNNEWLINE \sum_{j \leq n-\text{deg}\, Q -1} \sum_{K\in M_j} E(KQ, n, q) = \frac{ n-\text{deg}\, Q}{ 1-q} + O(q^{-3/2}). CARRIAGE_RETURNNEWLINE\]NEWLINE The second has the corollary that for \( \text{deg}\, Q = n-1\) we have \( E(Q, n, q) = \frac{1}{1-q} + O(q^{-3/2}) \).
- Correlation of arithmetic functions over \(\mathbb{F}_q[T]\)
- The covariance of almost-primes in \(\mathbb {F}_{q}[T]\)
- Prime polynomials in short intervals and in arithmetic progressions
- Simultaneous prime specializations of polynomials over finite fields
- Arithmetic properties of polynomial specializations over finite fields
- Variance of arithmetic sums and \(L\)-functions in \(\mathbb F_q[t]\)
- Correlation of arithmetic functions over \(\mathbb{F}_q[T]\)
- Shifted convolution and the Titchmarsh divisor problem over \(\mathbb F_q[t]\)
- Arithmetic properties of polynomial specializations over finite fields
- Pair Correlation of Squares in p-Adic Fields
- Cubic twin prime polynomials are counted by a modular form
- Correlations of sums of two squares and other arithmetic functions in function fields
- Correlation of multiplicative functions over Fq[x]$\mathbb {F}_q[x]$: A pretentious approach
- Correlation and lower bounds of arithmetic expressions
- An explicit polynomial analogue of Romanoff's theorem
This page was built for publication: Arithmetic correlations over large finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796766)