New lower bounds for three-term progression free sets in Fpn

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…