Rudnev, M. (2018). on the Number of Incidences Between Points and Planes in Three Dimensions
Total Page:16
File Type:pdf, Size:1020Kb
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 Peer reviewed version License (if available): Unspecified Link to published version (if available): 10.1007/s00493-016-3329-6 Link to publication record in Explore Bristol Research PDF-document This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Springer at http://link.springer.com/article/10.1007/s00493-016-3329-6#enumeration . Please refer to any applicable terms of use of the publisher. University of Bristol - Explore Bristol Research General rights This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: http://www.bristol.ac.uk/red/research-policy/pure/user-guides/ebr-terms/ ON THE NUMBER OF INCIDENCES BETWEEN POINTS AND PLANES IN THREE DIMENSIONS MISHA RUDNEV Abstract. We prove an incidence theorem for points and planes in the projective space P3 over any field F, whose characteristic p = 2. An incidence is viewed as an intersection 6 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 P3, 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 bilin- ⊆ 2 ear form ω, the number of distinct values of ω on pairs of points of S is Ω min S 3 ,p . h | | i This is also the best known bound over R, where it follows from the Szemer´edi-Trotter theorem. Also, a set S F3, not supported in a single semi-isotropic plane contains a ⊆ 1 point, from which Ω min S 2 ,p distinct distances to other points of S are attained. h | | i 1. Introduction Let F be a field of characteristic p and Pd the d-dimensional projective space over F. Our methods do not work for p = 2, but the results in view of constraints in terms of p hold trivially for p = O(1). As usual, we use the notation for cardinalities of finite sets. The symbols , , suppress absolute constants in inequalities,| · | as well as respectively do O and Ω. Besides,≪ X≫= Θ(Y ) means that X = O(Y ) and X = Ω(Y ). The symbols C and c stand for absolute constants, which may sometimes change from line to line, depending on the arXiv:1407.0426v5 [math.CO] 4 Dec 2015 context. When we turn to sum-products, we use the standard notation A + B = a + b : a A, b B { ∈ ∈ } for the sumset A + B of A, B F, similarly for the product set AB. ⊆ The Szemer´edi-Trotter theorem [37] on the number of incidences between lines and points in the Euclidean plane has many applications in combinatorics. The theorem is also valid over C, this was first proved by T´oth [38]. In positive characteristic, however, no universal satisfactory for applications point-line incidence estimate is available. The current “world record” for partial results in this direction for the prime residue field Fp is due to Jones [21]. This paper shows that in three dimensions there is an incidence estimate between a set P of m points and a set Π of n planes in P3, valid for any field of characteristic p = 2. If p> 0, there is a constraint that min(m,n)= O(p2). Hence, the result is trivial, unless6 p is 2000 Mathematics Subject Classification. 68R05,11B75. 1 2 MISHA RUDNEV regarded as a large parameter. Still, since our geometric set-up in terms of α-and β-planes in the Klein quadric breaks down for p = 2, we have chosen to state that p = 2 explicitly in the formulation of main results. Extending the results to more specific situations,6 when the constraint in terms of p can be weakened may not be impossible but way beyond the methodology herein. A few more words address this issue in the sequel. The set of incidences is defined as (1) I(P, Π) := (q, π) P Π: q π . { ∈ × ∈ } Over the reals, the point-plane incidence problem has been studied quite thoroughly throughout the past 25 years and several tight bounds are known. In general one can have all the points and planes involved to be incident to a single line in space, in which case the number of incidences is trivially mn. To do better than that, one needs some non- degeneracy assumption regarding collinearity, and the results quoted next differ as to the exact formulation of such an assumption. In the 1990 paper of Edelsbrunner et al. [10] it was proven (modulo slow-growing factors that can be removed, see [1]) that if no three planes are collinear in R3, 4 3 (2) I(P, Π) = O m 5 n 5 + m + n . | | This bound was shown to be tight for a wide range of m and n, owing to a construction by Brass and Knauer [7]. A thorough review of the state of the art by the year 2007 can be found in the paper of Apfelbaum and Sharir [1]. Elekes and T´oth [12] weakened the non-collinearity assumption down to that all planes were “not-too-degenerate”. That is a single line in a plane may support only a constant proportion of incidences in that plane. They proved a bound 3 (3) I(P, Π) = O (mn) 4 + m√n + n | | and presented a construction, showing it to be generally tight. The constructions supporting the tightness of both latter estimates are algebraic and extend beyond the real case. More recently, research in incidence geometry over R has intensified after the introduction of the polynomial partitioning technique in a breakthrough paper of Guth and Katz [14]. E.g., there is now a “continuous” generalisation of the bound (2) by Basit and Sheffer [3]: 4 +ǫ 3 2 (4) I(P, Π) = O∗ m 5 n 5 k 5 + mk + n , | | where k is the maximum number of collinear planes. For any ǫ> 0, the constant hidden in the O∗-symbol depends on ǫ. The proofs of the above results rely crucially on the order properties of R. Some of them, say (3) extend over C, for it is based on the Szemer´edi-Trotter theorem. Technically harder partitioning-based works like [3] have so far defied generalisation beyond R. This paper presents a different approach to point-plane incidences in the projective three- space P3. The approach appears to be robust enough to embrace, in principle, all fields F, but for the apparently special case of characteristic 2. When we have a specific field F in mind, we use the notation FP for the projective line P. The novelty of our approach is on its geometric side: we fetch and use extensively the classical XIX century Pl¨ucker- Klein formalism for line geometry in P3. This is combined with a recent algebraic incidence theorem for counting line-line intersections in three dimensions by Guth and Katz. The work of Guth and Katz, see [14] and the references contained therein for its prede- cessors, established two important theorems. Both rested on the polynomial Nullstellensatz ON THE NUMBER OF INCIDENCES BETWEEN POINTS AND PLANES IN THREE DIMENSIONS 3 principle, which was once again demonstrated to be so efficient a tool for discrete geometry problems by Dvir, who used it to resolve the finite field Kakeya conjecture [8]. The proof of the first Guth-Katz theorem, Theorem 2.10 in [14], was in essence algebraic, using the Nullstellensatz and basic properties of ruled surfaces, which come into play due to the use of the classical XIX century geometry Monge-Salmon theorem. See [33] for the original exposition of the latter theorem, as well as [23] (wholly dedicated to the prominent role this theorem plays in today’s incidence geometry) and Appendix in [24]. The second Guth-Katz theorem, Theorem 2.11 in [14], introduced the aforementioned method of polynomial partitioning of the real space, based on the Borsuk-Ulam theorem. It is the latter theorem of Guth and Katz that has recently attracted more attention and follow-ups. Since we work over any field, we cannot not use polynomial partitioning. It is a variant of Theorem 2.10 from [14] that plays a key role here, and is henceforth referred to as the Guth-Katz theorem. We share this, at least in part, with a recent work of Koll´ar [24] dedicated to point-line incidences in 3D, in particular over fields with positive characteristic. Theorem 1 (Guth-Katz). Let be a set of n straight lines in R3. Suppose, no more then two lines are concurrent. ThenL the number of pair-wise intersections of lines in is L 3 O n 2 + nk , where k is the maximum number of lines, contained in a plane or regulus.