Abstract
Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asymptotically sharp version of Freiman's theorem in $\F_2^n$: if $A \subseteq \F_2^n$ is a set for which |A + A| ≤ K|A| then A is contained in a subspace of size $2^{2K + O(\sqrt{K}\log K)}|A|$; except for the $O(\sqrt{K} \log K)$ error, this is best possible. If in addition we assume that A is a downset, then we can also cover A by O(K46) translates of a coordinate subspace of size at most |A|, thereby verifying the so-called polynomial Freiman–Ruzsa conjecture in this case. A common theme in the arguments is the use of compression techniques. These have long been familiar in extremal set theory, but have been used only rarely in the additive combinatorics literature.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference16 articles.
1. Additive Combinatorics
2. An analog of Freiman's theorem in groups;Ruzsa;Structure Theory of Set Addition, Astérisque,1999
3. [10] Green B. J. and Tao T. C. A note on the Freiman and Balog–Szemerédi–Gowers theorems in finite fields. Submitted; available at: http://www.arxiv.org/abs/math.CO/0701585. To appear in J. Austral. Math. Soc.
4. Orthogonal pairings of Euclidean spaces;Yuzvinsky;Michigan Math. J.,1981
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献