Exponential-facet threshold conjecture for volume approximation of the Euclidean ball

Let DnD_n be the Euclidean unit ball in Rn\mathbb{R}^n, let NN be a positive integer, and let Pn,NbP^b_{n,N} be a polytope with at most NN facets that is best-approximating for DnD_n with respect to the symmetric volume difference Δv\Delta_v. Exponential-threshold conjecture. If N2nN\leq 2^n and the dimension is sufficiently large, then

limnΔv(Dn,Pn,Nb)Dn=1.\lim_{n\to\infty}\frac{\Delta_v(D_n,P^b_{n,N})}{|D_n|}=1.

This is proposed as a strengthening of the elementary result that the same limit equals 11 when the number of facets is eo(n)e^{o(n)}, motivated by symmetry considerations.

Sources & referencesView supporting material

Primary source

Gil Kur, “Approximation of the Euclidean ball by polytopes with a restricted number of facets”, arXiv:1705.00210 (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.