Large sum-free subsets of sets of integers via $L^1$-estimates for trigonometric series — mentioned by svat

Sun, 25 May 2025 15:53:22 GMT

So cool. On the one hand, going from n/3 to (n/3 + log log n) seems like such a small improvement, but as the article shows, the history is formidable: - n/3 (Erdős, 1965) - (n+1)/3 (Alon and Kleitman, 1990) - (n+2)/3 (Bourgain, 1997) - n/3 + Ω(log log n) (this paper, Benjamin Bedert, https://arxiv.org/abs/2502.08624) And the upper bound: - n/3 + o(n) (Eberhard, Green, Manners, 2014). Ben Green's list of 100 open problems is which this is (was?) Problem 1, is here: https://people.maths.ox.ac.uk/greenbj/papers/open-problems.p...

Paper and discussion history. A mention is not an endorsement.

Large sum-free subsets of sets of integers via $L^1$-estimates for trigonometric series · HackerPapers discussions

Large sum-free subsets of sets of integers via $L^1$-estimates for trigonometric series — mentioned by svat