The Erdős–Moser sum-free set problem via improved bounds for k -configurations

Source abstract

Abstract A $k$-configuration is a collection of $k$ distinct integers $x_{1},\ldots ,x_{k}$ together with their pairwise arithmetic means $\frac{x_{i}+x_{j}}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini, and Kelman on binary systems of linear forms and of Kelley and Meka on Roth’s theorem on arithmetic progressions, we show that, for $N \geq \exp ((k\log (2/\alpha ))^{O(1)})$, any subset $A \subseteq [N]$ of density at least $\alpha$ contains a $k$-configuration. This improves on the previously best known bound $N \geq \exp ((2/\alpha )^{O(k^{2})})$, due to Shao. As a consequence, it follows that any finite non-empty set $A \subseteq \mathbb{Z}$ contains a subset $B \subseteq A$ of size at least $(\log |A|)^{1+\Omega (1)}$ such that $b_{1}+b_{2} \not \in A$ for any distinct $b_{1},b_{2} \in B$. This provides a new proof of a lower bound for the Erdős–Moser sum-free set problem of the same shape as the best known bound, established by Sanders.