Approximation of the Euclidean ball by polytopes with a restricted number of facets
Abstract
We prove that there is an absolute constant C such that for every n ≥ 2 and N≥ 10n, there exists a polytope Pn,N ⊂ Rn with at most N facets that satisfies v(Dn,Pn,N):=voln(Dn Pn,N)≤ Cn-2/(n-1voln(Dn) and s(Dn,Pn,N):=voln-1(∂(Dn Pn,N)) - voln-1(∂(Dn Pn,N)) ≤ 4CN-2n-1 voln-1(∂ Dn), where Dn is the n-dimensional Euclidean unit ball. This result closes gaps from several papers of Hoehner, Ludwig, Sch\"utt and Werner. The upper bounds are optimal up to absolute constants. This result shows that a polytope with an exponential number of facets (in the dimension) can approximate the n-dimensional Euclidean ball with respect to the aforementioned distances.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.