Part of the Bolyai Society Mathematical Studies book series (BSMS, volume 25)
Erdős and Arithmetic Progressions
Two of Erdős’s most famous conjectures concern arithmetic progressions. In this paper we discuss some of the progress that has been made on them.
KeywordsDiscrepancy Problem Arithmetic Progression Regularity Lemma Inverse Theorem Discrepancy Conjecture
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- D. R. Heath-Brown, Integer sets containing no arithmetic progressions, J. London Math. Soc. (2) 35 (1987), 385–394.Google Scholar
- A. R. D. Mathias, On a conjecture of Erdős and Čudakov, in Combinatorics, Geometry and Probability: A tribute to Paul Erdős, P. Erdős, B. Bollobás and A. Thomason eds., Cambridge 1997, pp. 489–492.Google Scholar
- I. Z. Ruzsa, E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, 939–945.Google Scholar
- E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299–345.Google Scholar
- T. C. Tao, A quantitative ergodic theory proof of Szemerédi’s theorem, Electron. J. Combin. 13 (2006), Research Paper 99, 49pp.Google Scholar
© János Bolyai Mathematical Society and Springer-Verlag 2013