Covering points by hyperplanes and related problems
Combinatorics
2026-02-16 v1 Computational Geometry
Abstract
For a set of points in , for any , a hyperplane is called -rich with respect to if it contains at least points of . Answering and generalizing a question asked by Peyman Afshani, we show that if the number of -rich hyperplanes in , , is at least , with a sufficiently large constant of proportionality and with , then there exists a -flat that contains points of . 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 -rich spheres or -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