Skip to content

Author

Adrian Beker

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Oct 2026

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

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...

Adrian Beker · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.