Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 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 triple products of large sets in amenable groups (1804.01164v1)

Published 3 Apr 2018 in math.FA and math.CO

Abstract: We answer a question of Hegyv\'ari and Ruzsa concerning effective estimates of the Bohr-regularity of certain triple sums of sets with positive upper Banach densities in the integers. Our proof also works for any discrete amenable group, and it does not require all addends in the triple products we consider to have positive (left) upper Banach densities; one of the addends is allowed to only have positive upper asymptotic density with respect to a (possibly very sparse) ergodic sequence.

Summary

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