English

Green-Tao theorem in function fields

Number Theory 2009-09-02 v2 Combinatorics

Abstract

We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every kk, the irreducible polynomials in Fq[t]\mathbf{F}_q[t] contain configurations of the form {f+Pg:\d(P)<k},g0\{f+ Pg : \d(P)<k \}, g \neq 0.

Keywords

Cite

@article{arxiv.0908.2642,
  title  = {Green-Tao theorem in function fields},
  author = {Thai Hoang Le},
  journal= {arXiv preprint arXiv:0908.2642},
  year   = {2009}
}

Comments

31 pages, unabridged version. Corrected typos and minor mistakes

R2 v1 2026-06-21T13:36:41.037Z