Pith. sign in

Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields

5 Pith papers cite this work. Polarity classification is still indexing.

5 Pith papers citing it
abstract

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a classical construction of Behrend from 1946 beyond lower-order factors (in particular, it is the first quasipolynomial improvement). In the setting of $\mathbb{F}_p^n$ for a fixed prime $p$ and large $n$, we prove a lower bound of $(cp)^n$ for some absolute constant $c>1/2$ (for $c = 1/2$, such a bound can be obtained via classical constructions from the 1940s, but improving upon this has been a well-known open problem).

years

2026 5

representative citing papers

Large Sets of Integers with No Harmonic Triples

math.NT · 2026-07-07 · accept · novelty 6.0

The author proves f(N) ≫ N exp(−(2√(log(24/7))+o(1))√(log log N)) for the largest harmonic-triple-free subset of [N], matching the form of the best 3-AP-free lower bound with log N replaced by log log N.

citing papers explorer

Showing 5 of 5 citing papers.