skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: On the $$L_p$$-Brunn–Minkowski and Dimensional Brunn–Minkowski Conjectures for Log-Concave Measures
Award ID(s):
1753260
PAR ID:
10212184
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
The Journal of Geometric Analysis
ISSN:
1050-6926
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We extend Prekopa’s Theorem and the Brunn-Minkowski Theo- rem from convexity to F-subharmonicity. We apply this to the interpolation problem of convex functions and convex sets introducing a new notion of “har- monic interpolation” that we view as a generalization of Minkowski-addition. 
    more » « less
  2. We show that for any even log-concave probability measure μ<#comment/> \mu on R n \mathbb {R}^n , any pair of symmetric convex sets K K and L L , and any λ<#comment/> ∈<#comment/> [ 0 , 1 ] \lambda \in [0,1] , μ<#comment/> ( ( 1 −<#comment/> λ<#comment/> ) K + λ<#comment/> L ) c n ≥<#comment/> ( 1 −<#comment/> λ<#comment/> ) μ<#comment/> ( K ) c n + λ<#comment/> μ<#comment/> ( L ) c n , \begin{equation*} \mu ((1-\lambda ) K+\lambda L)^{c_n}\geq (1-\lambda ) \mu (K)^{c_n}+\lambda \mu (L)^{c_n}, \end{equation*} where c n ≥<#comment/> n −<#comment/> 4 −<#comment/> o ( 1 ) c_n\geq n^{-4-o(1)} . This constitutes progress towards the dimensional Brunn-Minkowski conjecture (see Richard J. Gardner and Artem Zvavitch [Tran. Amer. Math. Soc. 362 (2010), pp. 5333–5353]; Andrea Colesanti, Galyna V. Livshyts, Arnaud Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139]). Moreover, our bound improves for various special classes of log-concave measures. 
    more » « less