2015
DOI: 10.1016/j.jnt.2014.12.016
|View full text |Cite
|
Sign up to set email alerts
|

Prime polynomial values of linear functions in short intervals

Abstract: In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime polynomial values of n linear functions, in the limit of a large finite field.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 14 publications
0
12
0
Order By: Relevance
“…The proof of Theorem 1.1 follows the pattern of similar proofs in the literature, like in [ABR15, BB15,BBR15,Ent14]. The main ingredient is an explicit Chebotarev theorem, which we recall now.…”
Section: Proof Of Theorem 11mentioning
confidence: 78%
“…The proof of Theorem 1.1 follows the pattern of similar proofs in the literature, like in [ABR15, BB15,BBR15,Ent14]. The main ingredient is an explicit Chebotarev theorem, which we recall now.…”
Section: Proof Of Theorem 11mentioning
confidence: 78%
“…Hence, the Galois group G = S n 1 × ... × S nr . Rest of the proof follows from [Theorem 3.1, [5]]. Thus…”
Section: Bateman-horn Conjecturementioning
confidence: 99%
“…Bank, Bary-Soroker and Rosenzweig [6] obtained the result on counting prime polynomials in the short interval I(A, h) for the primitive linear function f (t) + g(t)x. In [5] the function field analogue of Hardy -Littlewood prime tuple conjecture on these primitive linear functions is resolved in short interval case.…”
Section: Introductionmentioning
confidence: 99%
“…The distribution of primes, and more generally the distribution of factorization types, in "short intervals" in the setting of function fields over finite fields has received considerable attention [5,6,3,2,13]. For example, in [3], prime equidistribution for the family {f (x) + bx + a} a,b∈Fp was shown for f ∈ F p [x] any monic degree d polynomial (for p large.)…”
Section: Introductionmentioning
confidence: 99%
“…types of f (x) + a, for f Morse, is consistent (up to an error of size O d (p −1/2 )) with the distribution of cycle types of permutations in S d , the symmetric group on d letters, with respect to the Haar measure. (E.g., for σ = (12) ∈ S 3 , write out all trivial cycles, i.e., σ = (12)(3); the cycle type of σ is then (1,2) if we order according to cycle lengths. )…”
Section: Introductionmentioning
confidence: 99%