The Gaussian primes contain arbitrarily shaped constellations

Journal d'Analyse Mathematique

Volumn 99, Issue , 2006, Pages 109-176

  Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33847753436     PISSN: 00217670     EISSN: 15658538     Source Type: Journal    
DOI: 10.1007/BF02789444     Document Type: Article

References (24)

1. P. Frankl and V. Rödl, Extremal problems on set systems, Random Struct. Algorithms 20 (2002), 131-164.
2. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations. J. Analyse Math. 34 (1978), 275-291.
3. H. Furstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem, J. Analyse Math. 57(1991), 64-119.
4. D. Goldston and C. Y. Yildirim, Higher correlations of divisor sums related to primes, I: Triple correlations, Integers 3 (2003) A5, 66pp.
5. D. Goldston and C. Y. Yildirim, Higher correlations of divisor sums related to primes. III: k-correlations, preprint (available at AIM preprints).
6. D. Goldston and C. Y. Yildirim, Small gaps between primes, I, preprint.
7. T. Gowers, A new proof of Szemeredi's theorem, GAFA 11 (2001), 465-588.
8. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, preprint.
9. B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, preprint.
10. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th Ed., Oxford, Clarendon Press, 1979.
11. Y. Kohayakawa, V. Rödl and J. Skokan, Hypergraphs, quasi-randomness, and conditions for regularity, J. Combin. Theory Ser. A 97 (2002), no. 2, 307-352.
12. B. Nagle, V. Rödl and J. Skokan, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms, to appear.
13. J. Renze, S. Wagon and B. Wick, The Gaussian Zoo, Experimental Math. 10 (2001), 161-173.
14. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms, 25 (2004), 1-42.
15. V. Rödl and J. Skokan, Applications of the regularity lemma for uniform hypergraphs, preprint.
16. I. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Colloq. Math. Soc. J. Bolyai 18 (1978), 939-945.
17. J. Solymosi, Note on a generalization of Roth's theorem, Discrete and computational geometry, Algorithms Combin. 25, Springer Verlag, 2003, pp. 825-827.
18. J. Solymosi, A note on a question of Erdös and Graham, Combinatorics, Probability and Computing 13 (2004), 263-267.
19. E. Szemerédi, On sets of integers containing no four elements in arithmetic progression, Acta Math. Acad. Sci. Hungar. 20 (1969), 89-104.
20. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299-345.
21. T. Tao, A quantitative ergodic theory proof of Szemerédi's theorem, preprint.
22. T. Tao, A variant of the hypergraph removal lemma, preprint.
23. T. Tao, Arithmetic progressions in the primes, El Escorial conference proceedings.
24. T. Tao, A remark on Goldston-Yildirim correlation estimates, unpublished.