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

Adrian Beker

A $k$-configuration is a collection of $k$ distinct integers $x_1,\dots ,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1\le i<j\le k$. Building…