On counting point-hyperplane incidences
The authors discuss three closely related problems on the incidence structure between \(n\) points and \(m\) hyperplanes in \(d\)-dimensional space: the maximal number of incidences if there are no big bipartite subconfigurations, a compressed representation for the incidence structure, and a lower bound for any algorithm that determine the number of incidences. For this a construction of a special point-hyperplane configuration is presented. A lower bound is given, which almost meets the best upper bound known thus far.
scientific article; zbMATH DE number 1912420