REVIEW 4 cited by
Strong Bounds for 3-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
abstract
We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic progressions were known to exist only for sets of size at least $N/(\log N)^{1 + c}$ for a constant $c > 0$. Our approach is first to develop new analytic techniques for addressing some related questions in the finite-field setting and then to apply some analogous variants of these same techniques, suitably adapted for the more complicated setting of integers.
Forward citations
Cited by 4 Pith papers
-
Counting subsets of integers free of arithmetic configurations
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))}.
-
On polynomial progressions via transference
For any integer polynomial P with P(0)=0, any subset of [N] avoiding x, x+P(y), ..., x+kP(y) has size at most N (log log log N)^{-c}, with stronger bounds when P'(0)!=0.
-
Random linear configurations in dense sets and primes
Polylog-dense subsets of [N] and of the primes contain nontrivial configurations x+b₁m,…,x+bₖm for almost every coefficient vector b in wide ranges of scales.
-
On Fourier coefficients of sets with small doubling
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.
Discussion (0). Continue with ORCID to comment.