Piercing spanned lines and hyperplanes
Ben Lund
Source abstract
Motzkin, Grünbaum, and Erdős and Purdy asked how many noncollinear blue points can coexist with red points in the real plane if every blue-spanned line contains a red point. We prove that there are at most blue points, even over the complex numbers. For the complex higher-dimensional problem of Campbell, Kroeker, and Lund, we prove . Colorings of cyclic Dowling geometries give a matching lower bound in order of magnitude for all and . The planar proof uses frame normalization and a second-moment estimate; the higher-dimensional proof combines the degree bound of Kroeker and Lund with principal truncation.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.