We show that the number of incidences between m distinct points and n distinct lines in R 4 is O 2 c √ log m (m 2/5 n 4/5 + m) + m 1/2 n 1/2 q 1/4 + m 2/3 n 1/3 s 1/3 + n , for a suitable absolute constant c, provided that no 2-plane contains more than s input lines, and no hyperplane or quadric contains more than q lines. The bound holds without the factor 2 c √ log m when m ≤ n 6/7or m ≥ n 5/3 . Except for the factor 2 c √ log m , the bound is tight in the worst case.Keywords. Combinatorial geometry, incidences, the polynomial method, algebraic geometry, ruled surfaces.
IntroductionLet P be a set of m distinct points in R 4 and let L be a set of n distinct lines in R 4 . Let I(P, L) denote the number of incidences between the points of P and the lines of L; that is, the number of pairs (p, ℓ) with p ∈ P , ℓ ∈ L, and p ∈ ℓ. If all the points of P and all the lines of L lie in a common plane, then the classical Szemerédi-Trotter theorem [42] yields the worst-case tight boundThis bound clearly also holds in R 4 (or in any other dimension), by projecting the given lines and points onto some generic plane. Moreover, the bound will continue to be worst-case tight by placing all the points and lines in a common plane, in a configuration that yields the planar lower bound.In the recent groundbreaking paper of Guth and Katz [15], an improved bound has been derived for I(P, L), for a set P of m points and a set L of n lines in R 3 , provided that not too many lines of L lie in a common plane 1 . Specifically, they showed: Theorem 1.1 (Guth and Katz [15]). Let P be a set of m distinct points and L a set of n distinct lines in R 3 , and let s ≤ n be a parameter, such that no plane contains more than s lines of L. ThenThis bound is tight in the worst case.In this paper, we establish the following analogous and sharper result in four dimensions.1 The additional requirement in [15], that no regulus contains too many lines, is not needed for the incidence bound given below.1 Theorem 1.2. Let P be a set of m distinct points and L a set of n distinct lines in R 4 , and let q, s ≤ n be parameters, such that (i) each hyperplane or quadric contains at most q lines of L, and (ii) each 2-flat contains at most s lines of L. Thenwhere A and c are suitable absolute constants. When m ≤ n 6/7 or m ≥ n 5/3 , we get the sharper boundIn general, except for the factor 2 c √ log m , the bound is tight in the worst case, for any values of m, n, and for corresponding suitable ranges of q and s.The proof of Theorem 1.2 will be by induction on m. To facilitate the inductive process, we extend the theorem as follows. We say that a hyperplane or a quadric H in R 4 is q-restricted for a set of lines L and for an integer parameter q, if there exists a polynomial g H of degree at most O( √ q), such that each of the lines of L that is contained in H, except for at most q lines, is contained in some irreducible component of H ∩ Z(g H ) that is ruled by lines and is not a 2-flat (see below for details). In other words, a q-restricted hyperplane o...