2000 character limit reached
Helly numbers for Quantitative Helly-type results
Published 23 Sep 2024 in math.CO | (2409.15048v1)
Abstract: We obtain three Helly-type results. First, we establish a Quantitative Colorful Helly-type theorem with the optimal Helly number (2d) concerning the diameter of the intersection of a family of convex bodies. Second, we prove a Quantitative Helly-type theorem with the optimal Helly number (2d+1) for the pointwise minimum of logarithmically concave functions. Finally, we present a colorful version of the latter result with Helly number (number of color classes) (3d+1); however, we have no reason to believe that this bound is sharp.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.