Incidences between points and lines on two- and three-dimensional varieties

Abstract

Let P be a set of m points and L a set of n lines in R4, such that the points of P lie on an algebraic three-dimensional surface of degree D that does not contain hyperplane or quadric components, and no 2-flat contains more than s lines of L. We show that the number of incidences between P and L is I(P,L) = O(m1/2n1/2D + m2/3n1/3s1/3 + nD + m) , for some absolute constant of proportionality. This significantly improves the bound of the authors, for arbitrary sets of points and lines in R4, when D is not too large. The same bound holds when the three-dimensional surface is embedded in any higher dimensional space. For the proof of this bound, we revisit certain parts of [Sharir-Solomon16], combined with the following new incidence bound. Let P be a set of m points and L a set of n lines in Rd, for d 3, which lie in a common two-dimensional algebraic surface of degree D (assumed to be n1/2) that does not contain any 2-flat, so that no 2-flat contains more than s lines of L (here we require that the lines of L also be contained in the surface). Then the number of incidences between P and L is I(P,L) = O(m1/2n1/2D1/2 + m2/3D2/3s1/3 + m + n). When d=3, this improves the bound of Guth and Katz for this special case, when D n1/2. Moreover, the bound does not involve the term O(nD), that arises in most standard approaches, and its removal is a significant aspect of our result. Finally, we also obtain (slightly weaker) variants of both results over the complex field. For two-dimensional varieties, the bound is as in the real case, with an added term of O(D3). For three-dimensional varieties, the bound is as in the real case, with an added term of O(D6).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…