English

Kemperman's inequality and Freiman's lemma via few translates

Combinatorics 2023-07-12 v2 Group Theory Number Theory

Abstract

Let GG be a connected compact group equipped with the normalised Haar measure μ\mu. Our first result shows that given α,β>0\alpha, \beta>0, there is a constant c=c(α,β)>0c = c(\alpha,\beta)>0 such that for any compact sets A,BGA,B\subseteq G with αμ(B)μ(A)μ(B) \alpha\mu(B)\geq\mu(A)\geq \mu(B) and μ(A)+μ(B)1β \mu(A)+\mu(B)\leq 1-\beta, there exist b1,bcBb_1,\dots b_c\in B such that μ(A{b1,,bc})μ(A)+μ(B). \mu(A\cdot \{b_1,\dots,b_c\})\geq \mu(A)+\mu(B). A special case of this, that is, when G=TdG=\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 Rd\mathbb{R}^d. Thus, given dNd \in \mathbb{N}, we show that there exists c=c(d)>0c = c(d) >0 such that for any finite, non-empty set ARdA \subseteq \mathbb{R}^d which is not contained in a translate of a hyperplane, one can find a1,,acAa_1, \dots, a_c \in A satisfying A+{a1,,ac}(d+1)AOd(1). |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 Od(1)O_d(1) error term.

Keywords

Cite

@article{arxiv.2307.03066,
  title  = {Kemperman's inequality and Freiman's lemma via few translates},
  author = {Yifan Jing and Akshat Mudgal},
  journal= {arXiv preprint arXiv:2307.03066},
  year   = {2023}
}

Comments

18 pages; typos corrected, the error term in Theorem 1.2 improved