加载中…
In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens their conclusion, in particular proving that if has no non-trivial three-term arithmetic progressions then for some .

生成讲解博客的中文版本

生成AI智能校验的中文版本