Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Brunn-Minkowski type estimates for certain discrete sumsets (2409.05638v1)

Published 9 Sep 2024 in math.CO

Abstract: Let $d,k$ be natural numbers and let $\mathcal{L}1, \dots, \mathcal{L}_k \in \mathrm{GL}_d(\mathbb{Q})$ be linear transformations such that there are no non-trivial subspaces $U, V \subseteq \mathbb{Q}d$ of the same dimension satisfying $\mathcal{L}_i(U) \subseteq V$ for every $1 \leq i \leq k$. For every non-empty, finite set $A \subset \mathbb{R}d$, we prove that [ |\mathcal{L}_1(A) + \dots + \mathcal{L}_k(A) | \geq kd |A| - O{d,k}(|A|{1- \delta}), ] where $\delta >0$ is some absolute constant depending on $d,k$. Building on work of Conlon-Lim, we can show stronger lower bounds when $k$ is even and $\mathcal{L}_1, \dots, \mathcal{L}_k$ satisfy some further incongruence conditions, consequently resolving various cases of a conjecture of Bukh. Moreover, given any $d, k\in \mathbb{N}$ and any finite, non-empty set $A \subset \mathbb{R}d$ not contained in a translate of some hyperplane, we prove sharp lower bounds for the cardinality of the $k$-fold sumset $kA$ in terms of $d,k$ and $|A|$. This can be seen as a $k$-fold generalisation of Freiman's lemma.

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com