Sumset estimates in convex geometry

arXiv2206.01565MaRDI QIDQ6401037FDOQ6401037

Artem Zvavitch, Matthieu Fradelizi, Mokshay Madiman

Publication date: 3 June 2022

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 ${mathbbR}^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"unnecke-Ruzsa inequalities. In the last section of the paper, we provide connections of these inequalities to the classical Rogers-Shephard inequality.

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Mixed volumes and related topics in convex geometry (52A39) Inequalities and extremum problems involving convexity in convex geometry (52A40) Functional inequalities, including subadditivity, convexity, etc. (39B62)

This page was built for publication: Sumset estimates in convex geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401037)