Revisiting sums and products in countable and finite fields
Abstract We establish a polynomial ergodic theorem for actions of the affine group of a countable field K . As an application, we deduce—via a variant of Furstenberg’s correspondence principle—that for fields of characteristic zero, any ‘large’ set $E\subset K$ contains ‘many’ patterns of the form $\{p(u)+v,uv\}$ , for every non-constant polynomial $p(x)\in K[x]$ . Our methods are flexible enough that they allow us to recover analogous density results in the setting of finite fields and, with the aid of a finitistic variant of Bergelson’s ‘colouring trick’, show that for $r\in \mathbb N$ fixed, any r -colouring of a large enough finite field will contain monochromatic patterns of the form $\{u,p(u)+v,uv\}$ . In a different direction, we obtain a double ergodic theorem for actions of the affine group of a countable field. An adaptation of the argument for affine actions of finite fields leads to a generalization of a theorem of Shkredov. Finally, to highlight the utility of the aforementioned finitistic ‘colouring trick’, we provide a conditional, elementary generalization of Green and Sanders’ $\{u,v,u+v,uv\}$ theorem.
Authors
- Ioannis Kousek (ORCID: https://orcid.org/0009-0005-8655-0955)
Institutions
- University of Warwick (GB)
Publication Details
- Journal
- Ergodic Theory and Dynamical Systems
- Published
- 2025-10-13
- DOI
- https://doi.org/10.1017/etds.2025.10244
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00