Improved Bounds for Progression-Free Sets in $C_{8}^{n}$
Combinatorics
2018-05-16 v1 Number Theory
Abstract
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 , where denotes the cyclic group of order . For finite abelian groups , where denote positive integers such that , this also yields a bound of the form , with representing the number of indices with . In particular, . In this paper, we provide an exponential improvement for this bound, namely .
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