SearcharxivSearch

arXiv · 2609.02180

Helly-Type Theorems for Splitting Point Sets

Abstract

Let $0 < α\leq 1/2$. We say that a finite point set $P$ in $\mathbb{R}^d$ is $α$-split by a hyperplane $h$ if each of the closed half-spaces determined by $h$, contains at least $α|P|$ of the points of $P$. We further say $P$ is $α$-split by a $k$-dimensional flat $τ$ if $P$ is $α$-split by any hyperplane through $τ$. In the standard notation (which coincides with Tukey depth for $k= 0$), the $k$-flat $τ$ has depth $α$ with respect to $P$. We establish interesting Helly-type theorems for splitting families of finite point sets in $\mathbb{R}^d$. Unlike the classical sufficient Helly-type criteria for transversals to families of compact convex sets, which exist only for point and hyperplanes, our results extend to splitting families of point sets by collections of $k$-flats of arbitrary dimensionality $ 0 \leq k \leq d-1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Lidor Portal, Natan Rubin. 2026-09-03. Helly-Type Theorems for Splitting Point Sets. https://arxiv.org/abs/2609.02180

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Column Number of Delta-modular matrices: Refined Analysis via Sauer Matrices

In this paper, we build upon the analysis initiated by Gennadiy Averkov and Matthias Schymura (2022) and establish that the number of distinct columns of a $Δ$-modular matrix $A \in \mathbb{Z}^{m \times n}$ of rank $m$ is $O(m^3 Δ)$. This upper bound was previously known only for odd values of $Δ$. Recall that a matrix is called $Δ$-modular if the maximum of the absolute values of its $m \times m$ minors equals $Δ$.

math.CO

Curves, points, incidences and covering

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem -- if a set of $n^2$ points in the plane is covered by $n$ lines then can we say something about the configuration of the points?

math.CO