Character-free approach to progression-free sets

Abstract

We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).

Cited by in corpus (1)

• A probabilistic technique for finding almost-periods of convolutions