Sumset estimates in convex geometry

Abstract

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these inequalities were introduced. We study analogues of these sumset estimates in the context of convex geometry and Lebesgue measure on ${\mathbb{R}}^n$. First, we observe that, with respect to Minkowski summation, volume is supermodular to arbitrary order on the space of convex bodies. Second, we explore sharp constants in the convex geometry analogues of variants of the Plünnecke-Ruzsa inequalities. In the last section of the paper, we provide connections of these inequalities to the classical Rogers-Shephard inequality.

References in corpus (10)

• The entropy per coordinate of a random vector is highly constrained under convexity conditions
• Reverse Brunn-Minkowski and reverse entropy power inequalities for convex measures
• Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information
• Optimal Concentration of Information Content For Log-Concave Densities
• Entropy bounds on abelian groups and the Ruzsa divergence
• Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam region
• On the volume of the Minkowski sum of zonoids
• Characterization of Simplices via the Bezout Inequality for Mixed volumes
• Volumes of subset Minkowski sums and the Lyusternik region
• A combinatorial approach to small ball inequalities for sums and differences