An Improved Construction of Progression-Free Sets

Abstract

The problem of constructing dense subsets S of {1, 2, ..., n} that contain no three-term arithmetic progression was introduced by Erdőos and Turán in 1936. They have presented a construction with |S| = Ω(nlog32) elements. Their construction was improved by Salem and Spencer, and further improved by Behrend in 1946. The lower bound of Behrend is [EQUATION… (More)
DOI: 10.1137/1.9781611973075.72

3 Figures and Tables

Topics

  • Presentations referencing similar topics