
TL;DR
This paper refines a result by Green and Tao on sumsets in ${\Bbb F}_2^n$, showing that under certain conditions, a large subspace exists with properties related to the sumset size, using a modified proof technique.
Contribution
It improves the bounds on the size of the subspace in Green and Tao's sumset theorem within ${\Bbb F}_2^n$ using a modified method.
Findings
Existence of a large subspace with controlled sumset properties
Improved bounds on subspace size relative to set size
Method adaptation from Green and Tao's approach
Abstract
Let be the finite field of two elements, be the vector space of dimension over . For sets , their sumset is defined as the set of all pairwise sums with . Ben Green and Terence Tao proved that, let , if and , then there exists a subspace with and such that In this note, we shall use the method of Green and Tao with some modification to prove that if then the above conclusion still holds true.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography
