English

Covering points by hyperplanes and related problems

Combinatorics 2026-02-16 v1 Computational Geometry

Abstract

For a set PP of nn points in Rd\mathbb R^d, for any d2d\ge 2, a hyperplane hh is called kk-rich with respect to PP if it contains at least kk points of PP. Answering and generalizing a question asked by Peyman Afshani, we show that if the number of kk-rich hyperplanes in Rd\mathbb R^d, d3d \geq 3, is at least Ω(nd/kα+n/k)\Omega(n^d/k^\alpha + n/k), with a sufficiently large constant of proportionality and with dα<2d1d\le \alpha < 2d-1, then there exists a (d2)(d-2)-flat that contains Ω(k(2d1α)/(d1))\Omega(k^{(2d-1-\alpha)/(d-1)}) points of PP. We also present upper bound constructions that give instances in which the above lower bound is tight. An extension of our analysis yields similar lower bounds for kk-rich spheres or kk-rich flats.

Keywords

Cite

@article{arxiv.2412.05157,
  title  = {Covering points by hyperplanes and related problems},
  author = {Zuzana Patáková and Micha Sharir},
  journal= {arXiv preprint arXiv:2412.05157},
  year   = {2026}
}

Comments

8 pages

R2 v1 2026-06-28T20:25:48.815Z