Pith. sign in

REVIEW 10 cited by

Improved Bounds for Szemer\'{e}di's Theorem

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 2402.17995 v2 pith:DQ5VEVMB submitted 2024-02-28 math.CO math.NT

Improved Bounds for Szemer\'{e}di's Theorem

classification math.CO math.NT
keywords boundsszemertheoremarithmeticconsequencedenotedensityexists
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a consequence of recent quasipolynomial bounds on the inverse theorem for the Gowers $U^k$-norm as well as the density increment strategy of Heath-Brown and Szemer\'{e}di as reformulated by Green and Tao.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

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

  1. Counting subsets of integers free of arithmetic configurations

    math.CO 2026-07 conditional novelty 8.0

    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. Three-color van der Waerden numbers grow super-exponentially

    math.CO 2026-06 unverdicted novelty 8.0

    w(k;3) > 2^{k (log^* k)/4} for large k, so the three-color van der Waerden number grows super-exponentially.

  3. Random linear configurations in dense sets and primes

    math.NT 2026-07 accept novelty 7.0

    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.

  4. Arithmetic Progression-Free Subset-Sum Sets

    math.CO 2026-06 unverdicted novelty 7.0

    New lower bounds on g_3(n) via central trinomial coefficients and general exponential lower bounds for g_k(n) (k≥4), paired with upper exponential rates from digit constructions on nearly-regular graphs.

  5. On hyperbolic corners and unit-area triangles in planar sets of large measure

    math.CA 2026-05 unverdicted novelty 7.0

    Measurable sets in [0,R]² avoiding upward right triangles of area 1/2 satisfy |A| = O_c(R²/(log R)^c) for c<1/4 with Ω(R log R) example; for fixed-area triangles the bound sharpens to c<1/2 using a hyperbolic trilinea...

  6. A multidimensional Szemer\'{e}di theorem in integers

    math.NT 2026-05 unverdicted novelty 7.0

    Dense subsets of [N]^n contain configurations x, x + r^{m1}e1, ..., x + r^{mn}en for any fixed n and increasing exponents m_i, with density threshold (log N)^{-c}.

  7. Non-existence probabilities and lower tails in the critical regime via Belief Propagation

    math.CO 2026-04 unverdicted novelty 7.0

    Non-existence and lower-tail probabilities in the critical regime for hypergraph edge counts are approximated by the Bethe free energy at the unique fixed point of a Belief Propagation operator under structural condit...

  8. Hitting Arithmetic Progressions at the Square-Root Scale

    math.CO 2026-06 unverdicted novelty 6.0

    f(n²,n) ≥ n + (1/√2 + o(1))√n and f(p²,p) ≤ 2p − (√(2/3) − o(1))√(p/log p) for large primes p.

  9. Simplex volumes in hyperplane arrangements

    math.CO 2025-12 conditional novelty 6.0

    For hyperplane arrangements in R^d, the maximum number of minimum-volume d-simplices is Θ_d(n^d), and the guaranteed subset with all-distinct simplex volumes is o(n) in every dimension.

  10. Roth's Theorem in Super Smooth Numbers

    math.NT 2025-10 conditional novelty 5.0

    For fixed large K, every subset of the y=log^K N smooth numbers up to N with positive relative density contains a nontrivial 3-term arithmetic progression.