Pith. sign in

REVIEW 4 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.12290 v1 pith:ETMYOS7M submitted 2024-06-18 math.NT math.CO

classification math.NTmath.CO
keywords arithmeticbehrendboundclassicalconstructiondotsfirstimprovement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Counting subsets of integers free of arithmetic configurations

    math.CO 2026-07 conditional novelty 8.0 of 10

    For k≥5, infinitely many n have exactly 2^{r_k(n)(1+o(1))} k-AP-free subsets of [n]; for all n and k≥3 the count is 2^{O(r_k(n))}.

  2. An improved construction for the triangle removal lemma

    math.CO 2025-07 conditional novelty 8.0 of 10

    A new construction lowers the triangle-removal-lemma lower-bound exponent constant from about 0.83 to about 1.66, using a Euclidean-ball sumset estimate.

  3. Large Sets of Integers with No Harmonic Triples

    math.NT 2026-07 accept novelty 6.0 of 10

    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.

  4. On subsets of lattice cubes avoiding affine and spherical degeneracies

    math.CO 2025-09 conditional novelty 6.0 of 10

    New lower bounds for lattice sets avoiding subspheres and subspaces, including f_circ(n) ≥ 7n/12, via deletion-method counting of cyclic quadrilaterals and cospherical tuples.

Pith tools