A note on Elkin's improvement of Behrend's construction

2008/10/05 by Green, Ben, Wolf, Julia · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.0810.0732

Abstract

We provide a short proof of a recent result of Elkin in which large subsets of the integers 1 up to N free of 3-term progressions are constructed.

Cited by

• An improved construction for the triangle removal lemma

Related

• Sets of integers that do not contain long arithmetic progressions
• Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields
• Strong Bounds for 3-Progressions
• On sets of integers not containing long arithmetic progressions
• An Improved Construction of Progression-Free Sets