Quantitative (p, q) theorems in combinatorial geometry

From MaRDI portal
Publication:2012541

DOI10.1016/J.DISC.2017.06.017zbMATH Open1379.52007arXiv1504.01642OpenAlexW2963846517MaRDI QIDQ2012541FDOQ2012541

Pablo Soberón, David Rolnick

Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B'ar'any, the existence of weak epsilon-nets for convex sets and the (p,q) theorem of Alon and Kleitman. These methods can be applied to functions such as the volume, surface area or number of points of a discrete set. We also give general quantitative versions of the colorful Helly theorem for continuous functions.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Quantitative \((p, q)\) theorems in combinatorial geometry

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