New lower bounds for three-term progression free sets in $\mathbb{F}_p^n$
Abstract
We prove new lower bounds on the maximum size of sets or not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for any fixed integer and sufficiently large (in terms of ), there exists a three-term progression free subset of size for some absolute constant . Such a bound for can be obtained with a classical construction of Salem and Spencer from 1942, and improving upon this value of has been a well-known open problem (our proof gives ). Our construction relies on finding a subset of size at least with a certain type of reducibility property. This property allows us to ``lift'' to a three-term progression free subset of for large (even though the original set 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}
}