2000 character limit reached
Improved Helly numbers of product sets (2409.07262v2)
Published 11 Sep 2024 in math.CO and math.MG
Abstract: A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}d$ if the intersection of every subset of $k$ convex sets in $\mathcal 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 \subseteq \mathbb{R}$, including the ``exponential grid'' $A = {\alphan : n \in \mathbb{N}}$ and sets $A\subseteq \mathbb{Z}$ defined by congruence relations.
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.