betaFeedback

WorksMathematics

3-Cube-Free Sets in Cyclic Groups

Abstract

A set is called 33-cube-free if it contains no configuration of the following form: {x,y,z,x+y,x+z,y+z,x+y+z}\{x,y,z,x+y,x+z,y+z,x+y+z\}. We study the maximum density of 33-cube-free sets in finite cyclic groups. As observed by Meng, every 33-cube-free subset of Zm\mathbb Z_m has size at most 2m/32m/3, and this bound is sharp whenever 3∣m3\mid m. Our main result shows that there exists an absolute constant ε>0\varepsilon>0 such that, for every mm not divisible by 33, every 33-cube-free subset of Zm\mathbb{Z}_m has size at most (2/3−ε)m\left(2/3-\varepsilon\right)m. Thus, in this setting, the natural 2/32/3 barrier can be uniformly improved. Long and Wagner conjectured that every 33-cube-free subset of Z2n\mathbb Z_{2^n} has size at most 5⋅2n/85\cdot 2^n/8. We also establish this conjecture for 3-cube-free sets whose density in the layer of odd residues is at least 2/32/3. Together with induction, this reduces the conjecture to the case where this density lies in (5/8,2/3)(5/8,2/3).

Paper details

vlnc:W_mmtn4p7r
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…