On the Furstenberg-Katznelson constant for the IP Szemeredi theorem over finite fields

Abstract

Bergelson et al. observed that Furstenberg's proof of Szemeredi's theorem provides a positive lower bound on the density of arithmetic progressions in sets of positive density in the integers. Namely, for every δ∈(0,1] and every k∈ N, there exists a positive constant c=c(k,δ)>0 such that \n∈ N : d(E (E-n)… (E-(k-1)n))>c(k,δ)\ ≠ whenever d(E) δ. Similarly, Furstenberg and Katznelson proved the IP Szemeredi theorem, establishing in particular the existence of a constant cIP=cIP(k,δ)>0 such that \n∈ N : d(E (E-n)… (E-(k-1)n))>cIP(k,δ)\ is IP* whenever d(E) δ. In this paper, we study analogues of c and cIP and their ergodic-theoretic counterparts, crec and cIPrec, for vector spaces over finite fields. We provide a qualitative result and in special cases such as Roth's theorem and the IP-Roth theorem, we also provide strong quantitative bounds for these constants. Our tools are primarily ergodic theoretic; we study the characteristic factors and limit of multiple ergodic averages along IPs in vector spaces over finite fields.

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…