English

Improved Bounds for Progression-Free Sets in $C_{8}^{n}$

Combinatorics 2018-05-16 v1 Number Theory

Abstract

Let GG be a finite group, and let r3(G)r_{3}(G) represent the size of the largest subset of GG without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that r3(C4n)(3.61)nr_{3}(C_{4}^{n}) \leqslant (3.61)^{n}, where CmC_{m} denotes the cyclic group of order mm. For finite abelian groups Gi=1nCmiG \cong \prod_{i=1}^{n} C_{m_{i}}, where m1,,mnm_{1},\ldots,m_{n} denote positive integers such that m1mnm_{1} | \ldots | m_{n}, this also yields a bound of the form r3(G)(0.903)rk4(G)Gr_{3}(G) \leqslant (0.903)^{\operatorname{rk}_{4}(G)} |G|, with rk4(G)\operatorname{rk}_{4}(G) representing the number of indices i{1,,n}i \in \left\{1,\ldots,n\right\} with 4  mi4\ |\ m_{i}. In particular, r3(C8n)(7.22)nr_{3}(C_{8}^{n}) \leqslant (7.22)^{n}. In this paper, we provide an exponential improvement for this bound, namely r3(C8n)(7.09)nr_{3}(C_{8}^{n}) \leq (7.09)^{n}.

Keywords

Cite

@article{arxiv.1805.05549,
  title  = {Improved Bounds for Progression-Free Sets in $C_{8}^{n}$},
  author = {Fedor Petrov and Cosmin Pohoata},
  journal= {arXiv preprint arXiv:1805.05549},
  year   = {2018}
}

Comments

14 pages

R2 v1 2026-06-23T01:55:10.780Z