arXiv Analytics

Sign in

arXiv:math/0501314 [math.CO]AbstractReferencesReviewsResources

The Gaussian primes contain arbitrarily shaped constellations

Terence Tao

Published 2005-01-20, updated 2011-12-31Version 4

We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely many sets $\{a+rv_0,...,a+rv_{k-1}\}$, with $a \in \Z[i]$ and $r \in \Z \backslash \{0\}$, all of whose elements are Gaussian primes. The proof is modeled on a recent paper by Green and Tao and requires three ingredients. The first is a hypergraph removal lemma of Gowers and R\"odl-Skokan; this hypergraph removal lemma can be thought of as a generalization of the Szemer\'edi-Furstenberg-Katznelson theorem concerning multidimensional arithmetic progressions. The second ingredient is the transference argument of Green and Tao, which allows one to extend this hypergraph removal lemma to a relative version, weighted by a pseudorandom measure. The third ingredient is a Goldston-Yildirim type analysis for the Gaussian integers, which yields a pseudorandom measure which is concentrated on Gaussian "almost primes".

Comments: 58 pages, no figures. An issue (pointed out by Lilian Matthiesen) regarding the need to ensure the linear forms are not commensurate to their conjugate has been addressed
Journal: J. d.Analyse Mathematique 99 (2006), 109-176
Categories: math.CO, math.NT, math.PR
Subjects: 05C65, 11P32
Related articles: Most relevant | Search more
arXiv:math/0503572 [math.CO] (Published 2005-03-24, updated 2005-11-16)
A variant of the hypergraph removal lemma
arXiv:1804.00328 [math.CO] (Published 2018-04-01, updated 2018-09-21)
Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
arXiv:0809.1846 [math.CO] (Published 2008-09-10)
A Removal Lemma for Systems of Linear Equations over Finite Fields