The unconditional log-Brunn–Minkowski conjecture for symmetric convex bodies

About 13 years old · traced to

Let KK and LL be symmetric convex bodies in [?][?]; write V(K)V(K) for volume and, for 0<p<10<p<1, let [?][?] denote the LpL^p-Minkowski combination. For p=0p=0, define the 0-convex combination by its support function, so that

λ⋅K+o(1−λ)⋅L={x∈Rn∣x⋅u≤hKλ(u)hL1−λ(u) for all u∈Sn−1}.\lambda\cdot K+_o(1-\lambda)\cdot L=\{x\in\mathbb{R}^n\mid x\cdot u\leq h_K^\lambda(u)h_L^{1-\lambda}(u)\text{ for all }u\in S^{n-1}\}.

The unconditional log-Brunn–Minkowski conjecture. Inequality V(λ⋅K+o(1−λ)⋅L)≥V(K)λV(L)1−λV(\lambda\cdot K+_o(1-\lambda)\cdot L)\geq V(K)^\lambda V(L)^{1-\lambda} is true for all λ∈[0,1]\lambda\in[0,1] and all symmetric convex bodies K,LK,L in Rn\mathbb{R}^n. This is the limiting p=0p=0 form of the LpL^p Brunn–Minkowski inequality; the question concerns whether this multiplicative volume inequality holds universally in the symmetric setting.

References

Primary source

Christos Saroglou, “Remarks on the conjectured log-Brunn-Minkowski inequality”, arXiv:1311.4954 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.