Brunn-Minkowski type estimates for certain discrete sumsets
Albert Lopez Bruch, Yifan Jing, Akshat Mudgal

TL;DR
This paper establishes lower bounds for the size of sumsets formed by linear transformations of finite sets in Euclidean space, extending classical results and resolving parts of a conjecture by Bukh.
Contribution
It provides new Brunn-Minkowski type estimates for discrete sumsets under linear transformations, including stronger bounds under certain conditions, and generalizes Freiman's lemma to multiple sums.
Findings
Proved lower bounds for sumsets involving linear transformations with no common invariant subspace.
Extended results to cases with additional incongruence conditions, confirming parts of Bukh's conjecture.
Established sharp bounds for the size of k-fold sumsets, generalizing Freiman's lemma.
Abstract
Let be natural numbers and let be linear transformations such that there are no non-trivial subspaces of the same dimension satisfying for every . For every non-empty, finite set , we prove that \[ |\mathcal{L}_1(A) + \dots + \mathcal{L}_k(A) | \geq k^d |A| - O_{d,k}(|A|^{1- \delta}), \] where is some absolute constant depending on . Building on work of Conlon-Lim, we can show stronger lower bounds when is even and satisfy some further incongruence conditions, consequently resolving various cases of a conjecture of Bukh. Moreover, given any and any finite, non-empty set not contained in a translate of some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
