Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.05768 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908942774304768 |
|---|---|
| author | Shalom, Or |
| author_facet | Shalom, Or |
| contents | 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 $δ\in(0,1]$ and every $k\in \mathbb{N}$, there exists a positive constant $c=c(k,δ)>0$ such that $$\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c(k,δ)\} \neq \emptyset$$ whenever $d(E)\ge δ$. Similarly, Furstenberg and Katznelson proved the IP Szemeredi theorem, establishing in particular the existence of a constant $c_{\mathrm{IP}}=c_{\mathrm{IP}}(k,δ)>0$ such that $$\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c_{\mathrm{IP}}(k,δ)\}$$ is $\mathrm{IP}^*$ whenever $d(E)\ge δ$. In this paper, we study analogues of $c$ and $c_{\mathrm{IP}}$ and their ergodic-theoretic counterparts, $c^{\mathrm{rec}}$ and $c_{\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 $\mathrm{IP}$s in vector spaces over finite fields. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_05768 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Furstenberg-Katznelson constant for the IP Szemeredi theorem over finite fields Shalom, Or Dynamical Systems Combinatorics 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 $δ\in(0,1]$ and every $k\in \mathbb{N}$, there exists a positive constant $c=c(k,δ)>0$ such that $$\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c(k,δ)\} \neq \emptyset$$ whenever $d(E)\ge δ$. Similarly, Furstenberg and Katznelson proved the IP Szemeredi theorem, establishing in particular the existence of a constant $c_{\mathrm{IP}}=c_{\mathrm{IP}}(k,δ)>0$ such that $$\{n\in \mathbb{N} : d(E\cap (E-n)\cap\dots\cap (E-(k-1)n))>c_{\mathrm{IP}}(k,δ)\}$$ is $\mathrm{IP}^*$ whenever $d(E)\ge δ$. In this paper, we study analogues of $c$ and $c_{\mathrm{IP}}$ and their ergodic-theoretic counterparts, $c^{\mathrm{rec}}$ and $c_{\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 $\mathrm{IP}$s in vector spaces over finite fields. |
| title | On the Furstenberg-Katznelson constant for the IP Szemeredi theorem over finite fields |
| topic | Dynamical Systems Combinatorics |
| url | https://arxiv.org/abs/2604.05768 |