We establish a polynomial ergodic theorem for actions of the affine group of a countable field . As an application, we deduce–via a variant of Furstenberg’s correspondence principle–that for fields of characteristic zero, any “large” set contains “many” patterns of the form , for every non-constant polynomial . 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 new finitistic variant of Bergelson’s “colouring trick”, show that for fixed, any colouring of a large enough finite field will contain monochromatic patterns of the form . 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 generalisation of a theorem of Shkredov. Finally, to highlight the utility of the aforementioned finitistic “colouring trick”, we provide a conditional, elementary generalisation of Green and Sanders’ theorem.

生成讲解博客的中文版本

生成AI智能校验的中文版本