Kuperberg's bottleneck conjecture

Let VV be an nn-dimensional vector space, let VV^* be its dual, and let KVK\subset V be a centrally symmetric convex body centered at the origin. Write

K+={(x,y)K×Kx,y=1},K^+=\{(\vec{x},\vec{y})\in K\times K^\circ\mid\langle\vec{x},\vec{y}\rangle=1\}, K={(x,y)K×Kx,y=1},K^-=\{(\vec{x},\vec{y})\in K\times K^\circ\mid\langle\vec{x},\vec{y}\rangle=-1\},

and let KK^\diamondsuit be the convex hull of K+KK^+\cup K^-. Define

D(K)=VolK.D(K)=\operatorname{Vol}K^\diamondsuit.

Bottleneck conjecture. For convex bodies KK in nn dimensions with nn fixed, the volume D(K)D(K) is uniquely minimized when KK is an ellipsoid.

The inclusion KK×KK^\diamondsuit\subseteq K\times K^\circ gives D(K)M(K)D(K)\leq M(K), and the conjecture would improve the best asymptotic lower bound on Mahler volume described in the source. The source does not report a resolution.

Sources & referencesView supporting material

Primary source

Greg Kuperberg, “The bottleneck conjecture”, arXiv:math/9811119 (1999).

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.