A step beyond Freiman's theorem for set addition modulo a prime
arXiv:1805.12374
Abstract
Freiman's 2.4-Theorem states that any set satisfying and can be covered by an arithmetic progression of length at most . A more general result of Green and Ruzsa implies that this covering property holds for any set satisfying as long as the rather strong density requirement is satisfied. We present a version of this statement that allows for sets satisfying with the more modest density requirement of .
13 pages, 1 figure