加载中…
Let be a finite group, and let represent the size of the largest subset of without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \leqslant (3.61)^{n}C_{m}m$. For finite abelian groups , where denote positive integers such that , this also yields a bound of the form , with representing the number of indices $i \in \left{1,\ldots,n\right}4\ |\ m_{i}r_{3}(C_{8}^{n}) \leqslant (7.22)^{n}$. In this paper, we provide an exponential improvement for this bound, namely .

生成讲解博客的中文版本

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