On the Number of Incidences Between Points and Planes in Three Dimensions

62Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove an incidence theorem for points and planes in the projective space ℙ3 over any Field F, whose characteristic p ≠ 2. An incidence is viewed as an intersection along a line of a pair of two-planes from two canonical rulings of the Klein quadric. The Klein quadric can be traversed by a generic hyperplane, yielding a line-line incidence problem in a three-quadric, the Klein image of a regular line complex. This hyperplane can be chosen so that at most two lines meet. Hence, one can apply an algebraic theorem of Guth and Katz, with a constraint involving p if p > 0. This yields a bound on the number of incidences between m points and n planes in ℙ3, with m≥n as O(m√n + mk), where k is the maximum number of collinear planes, provided that n = O(p2) if p > 0. Examples show that this bound cannot be improved without additional assumptions. This gives one a vehicle to establish geometric incidence estimates when p >0. For a non-collinear point set S⊆F2 and a non-degenerate symmetric or skew-symmetric bilinear form ω, the number of distinct values of ω on pairs of points of S is Ω[min(|S|23,p)]. This is also the best known bound over ℝ, where it follows from the Szemerédi-Trotter theorem. Also, a set S ⊆ F3, not supported in a single semi-isotropic plane contains a point, from which Ω[min(|S|12,p)] distinct distances to other points of S are attained.

Author supplied keywords

Cite

CITATION STYLE

APA

Rudnev, M. (2018). On the Number of Incidences Between Points and Planes in Three Dimensions. Combinatorica, 38(1), 219–254. https://doi.org/10.1007/s00493-016-3329-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free