Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Kemperman's inequality and Freiman's lemma via few translates (2307.03066v2)

Published 6 Jul 2023 in math.CO, math.GR, and math.NT

Abstract: Let $G$ be a connected compact group equipped with the normalised Haar measure $\mu$. Our first result shows that given $\alpha, \beta>0$, there is a constant $c = c(\alpha,\beta)>0$ such that for any compact sets $A,B\subseteq G$ with $ \alpha\mu(B)\geq\mu(A)\geq \mu(B) $ and $ \mu(A)+\mu(B)\leq 1-\beta$, there exist $b_1,\dots b_c\in B$ such that [ \mu(A\cdot {b_1,\dots,b_c})\geq \mu(A)+\mu(B).] A special case of this, that is, when $G=\mathbb{T}d$, confirms a recent conjecture of Bollob\'as, Leader and Tiba. We also prove a quantitatively stronger version of such a result in the discrete setting of $\mathbb{R}d$. Thus, given $d \in \mathbb{N}$, we show that there exists $c = c(d) >0$ such that for any finite, non-empty set $A \subseteq \mathbb{R}d$ which is not contained in a translate of a hyperplane, one can find $a_1, \dots, a_c \in A$ satisfying [ |A+ {a_1, \dots, a_c}| \geq (d+1)|A| - O_d(1). ] The main term here is optimal and recovers the bounds given by Freiman's lemma up to the $O_d(1)$ error term.

Summary

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