A statistical approach to covering lemmas (Q2346575)

The Ruzsa covering lemma plays a crucial role in the proof of Freiman-Ruzsa theorem. In this paper the author prove the following version of Ruzsa's covering lemma. Let \(G\) be an abelian group of exponent \(r\) and \(A\) be a nonempty subset of \(G\) with the cardinality of the set \(A+A\) is at most \(K|A|\). Then the group generated by \(A\) has size at most \(\exp(O(K\log^{2}2K))|A|\), where the implied constant depends only on \(r\). First he proves a so called statistical covering lemma by using an inductive argument. The remaining part of the proof is based on Fourier analysis.