The dichotomy between structure and randomness, arithmetic progressions, and the primes

International Congress of Mathematicians, ICM 2006

Volumn 1, Issue , 2006, Pages 581-608

  Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Arithmetic combinatorics; Arithmetic progressions; Ergodic theory; Graph theory; Hypergraph theory; Prime numbers; Szemer di's theorem

Indexed keywords

ARITHMETIC PROGRESSIONS; COMBINATORICS; ERGODIC THEORY; HYPERGRAPH THEORY; PRIME NUMBER;

DECOMPOSITION; GRAPH THEORY; NUMBER THEORY;

RANDOM PROCESSES;

EID: 84878102737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (63)

1. Alon, N., Shapira, A., A characterization of the (natural) graph properties testable with one-sided error. In 46th Symposium on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2005, 429-438.
2. Behrend, F. A., On sets of integers which contain no three terms in arithmetic progression. Proc. Nat. Acad. Sci. 32 (1946), 331-332.
3. Bergelson, V., Host, B., Kra, B., Multiple recurrence and nilsequences. Invent. Math. 160 (2) (2005), 261-303.
4. κ. Israel J. Math. 54 (3) (1986), 307-316.
5. Bourgain, J., On triples in arithmetic progression. Geom. Funct. Anal. 9 (1999), 968-984.
6. Chung, F., Graham, R., Wilson, R. M., Quasi-random graphs. Combinatorica 9 (1989), 345-362.
7. Conze, J. P., Lesigne, E., Sur un théorème ergodique pour les mesures diagonales. In Probabilités, Publ. Inst. Rech. Math. Rennes, 1987-1, Univ. Rennes I, Rennes 1988, 1-31.
8. Erdõs, P., Turán, P., On some sequences of integers. J. London Math. Soc. 11 (1936), 261-264.
9. Frankl, P., Rödl, V., Extremal problems on set systems. Random Structures Algorithms 20 (2) (2002), 131-164.
10. Frieze, A., Kannan, R., Quick approximation to matrices and applications. Combinatorica 19 (2) (1999), 175-220.
11. Furstenberg, H., Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions. J. Analyse Math. 31 (1977), 204-256.
12. Furstenberg, H., Recurrence in Ergodic theory and Combinatorial Number Theory. Princeton University Press, Princeton, NJ, 1981.
13. Furstenberg, H., Katznelson, Y., Ornstein, D., The ergodic-theoretical proof of Szemerédi's theorem. Bull. Amer. Math. Soc. 7 (1982), 527-552.
14. n2 x). In Convergence in ergodic theory and probability (Columbus OH 1993), Ohio State Univ. Math. Res. Inst. Publ. 5, Walter de Gruyter, Berlin 1996, 193-227.
15. Goldston, D., Yildirim, C.Y., Higher correlations of divisor sums related to primes, I: Triple correlations. Integers 3 (2003), A5, 66pp. (electronic).
16. Goldston, D., Yildirim, C. Y., Higher correlations of divisor sums related to primes, III: k-correlations. Preprint.
17. Goldston, D., Yildirim, C.Y., Small gaps between primes, I. Preprint.
18. Goldston, D., Motohashi, Y., Pintz, J., Yildirim, C.Y., Small gaps between primes exist. Proc. Japan Acad. Ser. A Math. Sci. 82 (4) (2006), 61-65.
19. Gowers, T., A new proof of Szemerédi's theorem for arithmetic progressions of length four. Geom. Funct. Anal. 8 (1998), 529-551.
20. Gowers, T., A new proof of Szemerédi's theorem. Geom. Funct. Anal. 11 (2001), 465-588.
21. Gowers, T., Hypergraph regularity and the multidimensional Szemerédi theorem. Preprint.
22. Green, B. J., Roth's theorem in the primes. Ann. of Math. 161 (3) (2005), 1609-1636.
23. Green, B. J., A Szemerédi-type regularity lemma in abelian groups. Geom. Funct. Anal. 15 (2) (2005), 340-376.
24. Green, B. J., Finite field models in additive combinatorics. In Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 327, Cambridge University Press, Cambridge 2005, 1-27.
25. Green, B. J., Long arithmetic progressions of primes. Preprint.
26. Green, B. J., Konyagin, S., On the Littlewood problem modulo a prime. Canad. J. Math., to appear.
27. Green, B. J., Tao, T., Restriction theory of Selberg's sieve, with applications. J. Théor. Nombres Bordeaux 18 (2006), 147-182.
28. 3 norm. Proc. Edinburgh Math. Soc., to appear.
29. Green, B. J., Tao, T., Quadratic uniformity of the Möbius function. Preprint.
30. Green, B. J., Tao, T., Two linear equations in four prime unknowns. Preprint.
31. Green, B. J., Tao, T., New bounds for Szemerédi's theorem, I: Progressions of length 4 in finite field geometries. Preprint.
32. 4(N). In preparation.
33. 4(N). In preparation.
34. Green, B. J., Tao, T., On arithmetic regularity lemmas. In preparation.
35. Hardy, G. H., Littlewood, J. E., Some problems of "partitio numerorum"; III: On the expression of a number as a sum of primes. Acta Math. 44 (1923), 1-70.
36. Host, B., Progressions arithmetiques dans les nombres premiers (d'apres B. Green and T. Tao). Seminaire Bourbaki, Mars 2005, 57eme annee, 2004-2005, no. 944.
37. Host, B., Kra, B., Convergence of Conze-Lesigne averages. Ergodic Theory Dynam. Systems 21 (2) (2001), 493-509.
38. Host, B., Kra, B., Non-conventional ergodic averages and nilmanifolds. Ann. of Math. 161 (1) (2005) 397-488.
39. Komlós, J., A generalization of a problem of Steinhaus. Acta Math. Hungar. 18 (1967), 217-229.
40. Komlós, J., Simonovits, M., Szemerédi's regularity lemma and its applications in graph theory. In Combinatorics, Paul Erdös is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest 1996, 295-352.
41. Kra, B., The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view. Bull. Amer. Math. Soc. (N.S.) 43 (1) (2006), 3-23.
42. p estimates on the bilinear Hilbert transform for 2 < p < ∞. Ann. of Math. 146 (1997), 693-724.
43. Leibman, A., Polynomial sequences in groups. J. Algebra 201 (1998), 189-206.
44. L. Lovász, Szegedy, B., Szemerédi's lemma for the analyst. Preprint.
45. Nagle, B., Rödl, V., Schacht, M., The counting lemma for regular κ-uniform hypergraphs. Random Structures Algorithms 28 (2) (2006), 113-179.
46. Rödl, V., Schacht, M., Regular partitions of hypergraphs. Combin. Probab. Comput., to appear.
47. Rödl, V., Skokan, J., Regularity lemma for uniform hypergraphs. Random Structures Algorithms 25 (1) (2004), 1-42.
48. Rödl, V., Skokan, J., Applications of the regularity lemma for uniform hypergraphs. Random Structures Algorithms 28 (2) (2006), 180-194.
49. Roth, K.F., On certain sets of integers. J. London Math. Soc. 28 (1953), 245-252.
50. Ruzsa, I., Szemerédi E., Triple systems with no six points carrying three triangles. Colloq. Math. Soc. J. Bolyai 18 (1978), 939-945.
51. Stein, E. Harmonic Analysis: Real Variable Methods, Orthogonality, and Oscillatory Integrals. Princeton University Press, Princeton, NJ, 1993.
52. Szemerédi, E., On sets of integers containing no κ elements in arithmetic progression. Acta Arith. 27 (1975), 299-345.
53. Tao, T., A quantitative ergodic theory proof of Szemerédi's theorem. Electron. J. Combin., to appear.
54. Tao, T., Obstructions to uniformity, and arithmetic patterns in the primes. Quarterly J. Pure Appl. Math. 2 (2006), 199-217.
55. Tao, T., Arithmetic progressions in the primes. Collect. Math. (2006), Vol. Extra., 37-88.
56. Tao, T., Szemerédi's regularity lemma revisited. Contrib.Discrete Math. 1 (1) (2006), 8-28.
57. Tao, T., A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113 (7), 1257-1280.
58. Tao, T., The Gaussian primes contain arbitrarily shaped constellations. J. Anal. Math. 99 (2006), 109-176.
59. Tao, T., An ergodic transference theorem. Unpublished.
60. Tao, T., Vu, V., Additive Combinatorics. Book in preparation, Cambridge University Press.
61. van der Corput, J. G., Über Summen von Primzahlen und Primzahlquadraten. Math. Ann. 116 (1939), 1-50.
62. Varnavides, P., On certain sets of positive density. J. London Math. Soc. 34 (1959) 358-360.
63. Ziegler, T., Universal characteristic factors and Furstenberg averages. J. Amer. Math. Soc. 20 (2007), 53-97.