Proceedings of the London Mathematical Society · 2008 · 18 citations · 16 references
Natural SciencesComputer EngineeringNumber TheoryAlgebraic Number TheoryArithmetic GeometryGalois TheoryArithmetic Of Finite FieldsFinite Field ArithmeticFinite Field ComputationPolynomial Factorization Over Finite FieldsPrime Decomposition
Recently the author proposed a uniform analogue of the Bateman–Horn conjectures for polynomials with coefficients from a finite field (that is, for polynomials in Fq[T] rather than Z[T]). Here we use an explicit form of the Chebotarev density theorem over function fields to prove this conjecture in particular ranges of the parameters. We give some applications including the solution of a problem posed by Hall.
16
The primes contain arbitrarily long arithmetic progressions
Benjamin Green, Terence Tao · Annals of Mathematics · 2008 · 822 citations · Full text
<i>Linear Groups with an Exposition of the Galois Field Theory</i>
L. E. Dickson, J. Gillis · Physics Today · 1959 · 671 citations · Full text
Ben Green, Terence Tao · Annals of Mathematics · 2010 · 363 citations · Full text