Quasipolynomial Bounds for Arithmetic Progressions
For every fixed integer , there exist constants such that for every , , where is the largest size of a subset of with no nonconstant -term arithmetic progression.
The deduction from Theorem 2.1 and Propositions 10.2–10.4 to Theorem 1.1 is complete and rigorous, conditional on the internal analytic arguments and the cited external inverse and almost-periodicity theorems.
“Theorem 1.1. For each fixed integer k ≥ 3 there are constants Ck, ck, εk > 0 such that, for every N ≥ 2, rk(N) ≤ CkN exp(−ck(log N)^εk).” · Show in paper