The mixed-volume Minkowski-sum volume conjecture

Let dd be a positive integer, let mm be a real number, and let K1,,KdK_1,\ldots,K_d be convex bodies in \mathdsRd\mathds{R}^d satisfying

Vol(K1)1, , Vol(Kd)1,and  V(K1,,Kd)=m.\operatorname{Vol}(K_1) \ge 1,\ \ldots,\ \operatorname{Vol}(K_d) \ge 1,\quad\text{and }\ \operatorname{V}(K_1,\ldots,K_d)=m.

For an integer \ell with 1d1\leq\ell\leq d, the mixed-volume Minkowski-sum volume conjecture. The maximum of Vol(K1++K)\operatorname{Vol}(K_1+\cdots+K_\ell) equals (m+1)d(m+\ell-1)^d and is attained when K1=mK2==mKdK_1=mK_2=\cdots=mK_d with Vol(Kd)=1\operatorname{Vol}(K_d)=1.

Sources & referencesView supporting material

Primary source

Gennadiy Averkov, Christopher Borger and Ivan Soprunov, “Inequalities between mixed volumes of convex bodies: volume bounds for the Minkowski sum”, arXiv:2002.03065 (2020).

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.