Quantitative Helly-type theorems via sparse approximation
From MaRDI portal
Abstract: We prove the following sparse approximation result for polytopes. Assume that is a polytope in John's position. Then there exist at most vertices of whose convex hull satisfies . 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 of convex bodies in with intersection , we may select at most members of such that their intersection has volume at most , and it has diameter at most , for some absolute constant .
Recommendations
Cites work
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A mélange of diameter Helly-type theorems
- A quantitative Helly-type theorem: containment in a homothet
- Absolute and Unconditional Convergence in Normed Linear Spaces
- Asymptotic geometric analysis. I
- Brascamp-Lieb inequality and quantitative versions of Helly's theorem
- Continuous quantitative Helly-type results
- Functional John ellipsoids
- Helly's Theorem with Volumes
- Helly-type problems
- John's decomposition in the general case and applications
- Polynomial esimates towards a sharp Helly-type theorem for the diameter of convex sets
- Proof of a conjecture of Bárány, Katchalski and Pach
- Quantitative Helly-Type Theorems
- Quantitative Helly-type theorem for the diameter of convex sets
Cited in
(4)
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)