Popular progression differences in vector spaces II

Abstract

Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every α>0, β<α3, and prime number p, there is a least positive integer np(α,β) such that if n ≥ np(α,β), then for every subset of Fpn of density at least α there is a nonzero d for which the density of three-term arithmetic progressions with common difference d is at least β. We determine for p ≥ 19 the tower height of np(α,β) up to an absolute constant factor and an additive term depending only on p. In particular, if we want half the random bound (so β=α3/2), then the dimension n required is a tower of twos of height (( p) (1/α)). It turns out that the tower height in general takes on a different form in several different regions of α and β, and different arguments are used both in the upper and lower bounds to handle these cases.

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…