Correlation of arithmetic functions over 𝔽𝑞[𝑇]
For a fixed polynomial 𝛥, we study the number of polynomials f of degree n over 𝔽𝑞 such that f and 𝑓+𝛥 are both irreducible, an 𝔽𝑞[𝑇]-analogue of the twin primes problem. In the large-q limit, we obtain a lower-order term for this count if we consider non-monic polynomials, which depends on 𝛥 in a m...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2019
|