Improved bounds for progression-free sets in \(C_8^n\) (Q2182029): Difference between revisions

A non-trivial three-term progression in a finite group \(G\) is an ordered triple \((a,b,c)\in G^3\) of mutually distinct elements such that \(ac = b^2\). Let \(r_3(G)\) be the size of the largest \(A \subset G\) without non-trivial three-term progressions. Recently, \textit{E. Croot} et al. [Ann. Math. (2) 185, No. 1, 331--337 (2017; Zbl 1425.11019)] proved that \(r_3(C_4^n)\leq 4^{\gamma n} \approx (3.611)^n\), where \(C_n\) denotes the cyclic group of order \(n\) and \(\gamma\approx 0.926\) is given in terms of the binary entropy function \(\mathcal{H}_2\). \textit{J. S. Ellenberg} and \textit{D. Gijswijt} [Ann. Math. (2) 185, No. 1, 339--343 (2017; Zbl 1425.11020)] showed that their method can be used to bound subsets of \(\mathbb{F}_q^n\) with no three terms in arithmetic progression. In the paper under review, the authors prove an upper bound for \(|A|\) with \(A\subset C_8^n\) and without non-trivial three-term progression with an exponent given in terms of the entropy function which yields \(r_3(C_8^n) \leq (7.0899)^n\). The authors also reprove the Croot-Lev-Pach bound for \(C_4^m\) using a group ring technique. Some other related results can also be found in the paper.