A structure theorem for sets of small popular doubling
Combinatorics
2015-06-02 v1
Abstract
In this paper we prove that every set satisfying the inequality for and in suitable ranges, then must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset satisfies ; specifically we show that .
Cite
@article{arxiv.1506.00445,
title = {A structure theorem for sets of small popular doubling},
author = {Przemysław Mazur},
journal= {arXiv preprint arXiv:1506.00445},
year = {2015}
}