A statistical approach to covering lemmas
Combinatorics
2016-10-25 v1
Abstract
We discuss a statistical variant of Ruzsa's covering lemma and use it to show that if G is an Abelian group of bounded exponent and A in G has |A+A| < K|A| then the subgroup generated by A has size at most exp(O(K log^22K))|A|, where the constant in the big-O depends on the exponent of the group only.
Cite
@article{arxiv.1610.07096,
title = {A statistical approach to covering lemmas},
author = {Tom Sanders},
journal= {arXiv preprint arXiv:1610.07096},
year = {2016}
}
Comments
18pp