WorksMathematics
3-Cube-Free Sets in Cyclic Groups
Abstract
A set is called -cube-free if it contains no configuration of the following form: . We study the maximum density of -cube-free sets in finite cyclic groups. As observed by Meng, every -cube-free subset of has size at most , and this bound is sharp whenever . Our main result shows that there exists an absolute constant such that, for every not divisible by , every -cube-free subset of has size at most . Thus, in this setting, the natural barrier can be uniformly improved. Long and Wagner conjectured that every -cube-free subset of has size at most . We also establish this conjecture for 3-cube-free sets whose density in the layer of odd residues is at least . Together with induction, this reduces the conjecture to the case where this density lies in .