For subsets K,L⊂Rn, their Minkowski sum is
K+L := {x+y: x∈K, y∈L}.
In general, one cannot expect a reverse Brunn-Minkowski inequality for arbitrary compact sets, even with a fixed multiplicative constant.
[Bas1995-no-general-reverse]
Milman's reverse Brunn-Minkowski theorem says that for centrally symmetric convex bodies, after putting the bodies in a suitable relative position, one does get a dimension-free reverse inequality.
[Bas1995-milman-statement]
More precisely, define CRBM as the infimum of constants C>0 such that for every n≥1 and every pair of centrally symmetric convex bodies B1,B2⊂Rn, there exists a linear map u with ∣detu∣=1 satisfying
∣u(B1)+B2∣1/n ≤ C(∣B1∣1/n+∣B2∣1/n).
[Bas1995-milman-statement]
We define
C70 := CRBM,
the reverse Brunn-Minkowski constant.
Milman's theorem implies CRBM<∞.
[Bas1995-milman-statement]
A trivial lower bound is CRBM≥1.
Thus the best established range currently is
1 ≤ C70 < ∞.