English

New lower bounds for three-term progression free sets in $\mathbb{F}_p^n$

Combinatorics 2024-01-24 v1 Number Theory

Abstract

We prove new lower bounds on the maximum size of sets AFpnA\subseteq \mathbb{F}_p^n or AZmnA\subseteq \mathbb{Z}_m^n not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for any fixed integer m2m\ge 2 and sufficiently large nn (in terms of mm), there exists a three-term progression free subset AZmnA\subseteq \mathbb{Z}_m^n of size A(cm)n|A|\ge (cm)^n for some absolute constant c>1/2c>1/2. Such a bound for c=1/2c=1/2 can be obtained with a classical construction of Salem and Spencer from 1942, and improving upon this value of 1/21/2 has been a well-known open problem (our proof gives c=0.54c= 0.54). Our construction relies on finding a subset SZm2S\subset \mathbb{Z}_m^2 of size at least (7/24)m2(7/24)m^2 with a certain type of reducibility property. This property allows us to ``lift'' SS to a three-term progression free subset of Zmn\mathbb{Z}_m^n for large nn (even though the original set SZm2S\subset \mathbb{Z}_m^2 does contain three-term arithmetic progressions).

Keywords

Cite

@article{arxiv.2401.12802,
  title  = {New lower bounds for three-term progression free sets in $\mathbb{F}_p^n$},
  author = {Christian Elsholtz and Laura Proske and Lisa Sauermann},
  journal= {arXiv preprint arXiv:2401.12802},
  year   = {2024}
}