Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bohr sets in sumsets II: countable abelian groups (2207.04150v3)

Published 8 Jul 2022 in math.CO and math.DS

Abstract: We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting $G$ be a countable discrete abelian group and $\phi_1, \phi_2, \phi_3: G \to G$ be commuting endomorphisms whose images have finite indices, we show that (1) If $A \subset G$ has positive upper Banach density and $\phi_1 + \phi_2 + \phi_3 = 0$, then $\phi_1(A) + \phi_2(A) + \phi_3(A)$ contains a Bohr set. This generalizes a theorem of Bergelson and Ruzsa in $\mathbb{Z}$ and a recent result of the first author. (2) For any partition $G = \bigcup_{i=1}r A_i$, there exists an $i \in {1, \ldots, r}$ such that $\phi_1(A_i) + \phi_2(A_i) - \phi_2(A_i)$ contains a Bohr set. This generalizes a result of the second and third authors from $\mathbb{Z}$ to countable abelian groups. (3) If $B, C \subset G$ have positive upper Banach density and $G = \bigcup_{i=1}r A_i$ is a partition, $B + C + A_i$ contains a Bohr set for some $i \in {1, \ldots, r}$. This is a strengthening of a theorem of Bergelson, Furstenberg, and Weiss. These results are quantitative in the sense that the radius and rank of the Bohr set obtained depends only on the indices $[G:\phi_j(G)]$, the upper Banach density of $A$ (in (1)), or the number of sets in the given partition (in (2) and (3)).

Summary

We haven't generated a summary for this paper yet.