On sets of integers containing k elements in arithmetic progression

From MaRDI portal





In this paper, the author, by an exceedingly ingenious method, settles in the affirmative the following famous conjecture: For all \(\varepsilon>0\) and \(k\), there exists \(N(k,\varepsilon)\) such that if \(n>N(k,\varepsilon)\) and \(R\) is a set of natural numbers \(\subseteq [0,n)\) with \(| R|>\varepsilon n\), then \(R\) contains an arithmetic progression with \(k\) terms. Previously the conjecture was settled for the case \(k=3\) by \textit{K. F. Roth} in 1952 [J. Lond. Math. Soc. 28, 104--109 (1953; Zbl 0050.04002)] and for the case \(k=4\) by E. Szemerédi himself in 1967 [Acta Math. Acad. Sci. Hung. 20, 89--104 (1969; Zbl 0175.04301)]. The method of proof in the present paper, though very complicated, is `elementary'.




Cited in
(only showing first 100 items - show all)








This page was built for publication: On sets of integers containing k elements in arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4059028)