Pith. sign in

REVIEW 1 cited by

The Kelley--Meka bounds for sets free of three-term arithmetic progressions

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 2302.07211 v3 pith:L5YGYFYL submitted 2023-02-14 math.NT math.CO

classification math.NTmath.CO
keywords arithmetickelleymekaprogressionssomeboundsldotssets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We give a self-contained exposition of the recent remarkable result of Kelley and Meka: if $A\subseteq \{1,\ldots,N\}$ has no non-trivial three-term arithmetic progressions then $\lvert A\rvert \leq \exp(-c(\log N)^{1/12})N$ for some constant $c>0$. Although our proof is identical to that of Kelley and Meka in all of the main ideas, we also incorporate some minor simplifications relating to Bohr sets. This eases some of the technical difficulties tackled by Kelley and Meka and widens the scope of their method. As a consequence, we improve the lower bounds for finding long arithmetic progressions in $A+A+A$, where $A\subseteq \{1,\ldots,N\}$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. On Fourier coefficients of sets with small doubling

    math.CO 2024-12 conditional novelty 7.0 of 10

    Under the condition 100K^2 δ ≤ 1, a set with small doubling and small Fourier coefficients must have a dense intersection with a translate of a large regular Bohr set of controlled dimension.

Pith tools