Skip to main navigation Skip to search Skip to main content

Helly-Type Theorems for Splitting Point Sets

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Let 0 < α ≤ 1/2. We say that a finite point set P in ℝ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 ℝ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 ≤ k ≤ d− 1.

Original languageEnglish
Title of host publicationProceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026
EditorsKasper Green Larsen, Barna Saha
PublisherAssociation for Computing Machinery
Pages2888-2902
Number of pages15
ISBN (Electronic)9781611978971
DOIs
StatePublished - 1 Jan 2026
Event37th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026 - Vancouver, Canada
Duration: 11 Jan 202614 Jan 2026

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume2026-January
ISSN (Print)1071-9040
ISSN (Electronic)1557-9468

Conference

Conference37th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026
Country/TerritoryCanada
CityVancouver
Period11/01/2614/01/26

ASJC Scopus subject areas

  • Software
  • General Mathematics

Fingerprint

Dive into the research topics of 'Helly-Type Theorems for Splitting Point Sets'. Together they form a unique fingerprint.

Cite this