Improved Helly numbers of product sets

Abstract

A finite family F of convex sets is k-intersecting in S ⊂eq Rd if the intersection of every subset of k convex sets in F contains a point in S. The Helly number of S is the minimum k, if it exists, such that every k-intersecting family contains a point of S in its intersection. In this paper, we improve bounds on the Helly number of product sets of the form Ad for various sets A ⊂eq R, including the ``exponential grid'' A = \αn : n ∈ N\ and sets A⊂eq Z defined by congruence relations.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…