Ergodic Theorem involving additive and multiplicative groups of a field and \x+y,xy\ patterns

Abstract

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field K and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in K contains many configurations of the form \x+y,xy\. We also show that for any finite coloring of K there are many x,y∈ K such that x,x+y and xy have the same color. Finally, by utilizing a finitistic version of our main ergodic theorem, we obtain combinatorial results pertaining to finite fields. In particular we obtain an alternative proof for a result obtained by Cilleruelo [11], showing that for any finite field F and any subsets E1,E2⊂ F with |E1||E2|>6|F|, there exist u,v∈ F such that u+v∈ E1 and uv∈ E2.

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…