English

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

Dynamical Systems 2026-04-08 v1 Combinatorics

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]\delta\in(0,1] and every kNk\in \mathbb{N}, there exists a positive constant c=c(k,δ)>0c=c(k,\delta)>0 such that {nN:d(E(En)(E(k1)n))>c(k,δ)}\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c(k,\delta)\} \neq \emptyset whenever d(E)δd(E)\ge \delta. Similarly, Furstenberg and Katznelson proved the IP Szemeredi theorem, establishing in particular the existence of a constant cIP=cIP(k,δ)>0c_{\mathrm{IP}}=c_{\mathrm{IP}}(k,\delta)>0 such that {nN:d(E(En)(E(k1)n))>cIP(k,δ)}\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c_{\mathrm{IP}}(k,\delta)\} is IP\mathrm{IP}^* whenever d(E)δd(E)\ge \delta. In this paper, we study analogues of cc and cIPc_{\mathrm{IP}} and their ergodic-theoretic counterparts, crecc^{\mathrm{rec}} and cIPrecc_{\mathrm{IP}}^{\mathrm{rec}}, 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 IP\mathrm{IP}s in vector spaces over finite fields.

Keywords

Cite

@article{arxiv.2604.05768,
  title  = {On the Furstenberg-Katznelson constant for the IP Szemeredi theorem over finite fields},
  author = {Or Shalom},
  journal= {arXiv preprint arXiv:2604.05768},
  year   = {2026}
}

Comments

54 pages