It concerns the size of the largest sum-free set [0]. Take a (finite) set of integers, A. What is the largest subset of A such that no two entries sum to a third.
The previous results was not much better than |A|/3. The current, just proved, result shows that the largest subset is |A|/3 + c log(log(|A|)).
For example, the set {1,2,3} is not sum-free (1+2 = 3) but the subset {2,3} is sum-free (2+3 \notin {2,3}).
"It concerns the size of the largest sum-free set [0]. Take a (finite) set of integers, A. What is the largest subset of A such that no two entries sum to a third."
Yes, it seems to me we are focusing mainly about sets, not addition. Addition is secondary. Mainly I'm debating the title. The word "set" ought to be in the title too. I guess not a big deal.
Although as students we learn addition before we learn about sets, from the viewpoint of mathematics, sets are everywhere / everything can be expressed in terms of sets, so there's no point talking about sets in any given problem (unless it involves matters deep in set theory, which this does not). This is evident even colloquially, where we can talk about problems without explicitly using the word “set” — for example, “given some numbers, how many can you pick such that no two of them add up to another?” — while it's hard to avoid using “add” or “addition”.
So this problem is really more about addition than about sets, as the mathematicians who worked on it will say: the amount of set theory it involves is very little/almost nonexistent, while the properties of addition it involves are fairly deep.
(But sure, no harm if sets were mentioned in the title, I guess!)
The previous results was not much better than |A|/3. The current, just proved, result shows that the largest subset is |A|/3 + c log(log(|A|)).
For example, the set {1,2,3} is not sum-free (1+2 = 3) but the subset {2,3} is sum-free (2+3 \notin {2,3}).
[0] https://en.wikipedia.org/wiki/Sum-free_set