Approximation of the Euclidean ball by polytopes with a restricted number of facets

From MaRDI portal
Publication:5220132

DOI10.4064/SM180114-22-5zbMATH Open1447.52010arXiv1705.00210OpenAlexW2979832966WikidataQ127099439 ScholiaQ127099439MaRDI QIDQ5220132FDOQ5220132


Authors: Gil Kur Edit this on Wikidata


Publication date: 10 March 2020

Published in: Studia Mathematica (Search for Journal in Brave)

Abstract: We prove that there is an absolute constant C such that for every ngeq2 and Ngeq10n, there exists a polytope Pn,NsubsetmathbbRn with at most N facets that satisfies Delta_{v}(D_n,P_{n,N}):= ext{vol}_nleft(D_n Delta P_{n,N} ight)leq Cn^{-2/(n-1} ext{vol}_nleft(D_n ight) and Delta_{s}(D_n,P_{n,N}):= ext{vol}_{n-1}left(partialleft(D_ncup P_{n,N} ight) ight) - ext{vol}_{n-1}left(partialleft(D_ncap P_{n,N} ight) ight) leq 4CN^{-frac{2}{n-1}} ext{vol}_{n-1}left(partial D_n ight), 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.


Full work available at URL: https://arxiv.org/abs/1705.00210




Recommendations





Cited In (13)





This page was built for publication: Approximation of the Euclidean ball by polytopes with a restricted number of facets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220132)