The Weak Anti-Freiman conjecture
The Weak Anti-Freiman conjecture
Let be a finite set. For every subset , suppose that
Here, a set is a set in which every integer has at most representations as a sum of two elements, and a set is a set in which every nonzero integer has at most representations as a difference of two elements.
Weak Anti-Freiman conjecture. Then contains either a set or a set of size at least , where and depend only on .
The conjecture is presented as a weaker version of an anti-Freiman question, but the paper states immediately afterward that it is false and constructs counterexamples.
Sources & referencesView supporting material
Primary source
Allison Lewko and Mark Lewko, “On the Structure of Sets of Large Doubling”, arXiv:1003.4561 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.