Quantitative Helly-type theorems via sparse approximation

From MaRDI portal




Abstract: We prove the following sparse approximation result for polytopes. Assume that Q is a polytope in John's position. Then there exist at most 2d vertices of Q whose convex hull Q satisfies Qsubseteq2d2,Q. As a consequence, we retrieve the best bound for the quantitative Helly-type result for the volume, achieved by Brazitikos, and improve on the strongest bound for the quantitative Helly-type theorem for the diameter, shown by Ivanov and Nasz'odi: We prove that given a finite family mathcalF of convex bodies in mathbbRd with intersection K, we may select at most 2d members of mathcalF such that their intersection has volume at most (cd)3d/2,mathrmvol,K, and it has diameter at most 2d2,mathrmdiam,K, for some absolute constant c>0.











This page was built for publication: Quantitative Helly-type theorems via sparse approximation

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