Incidence Theorems and Their Applications

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we will discuss are: (1) Counting incidences: Given a set (or several sets) of geometric objects (lines, points, etc..), what is the maximum number of incidences (or intersections) that can exist between elements in different sets? We will see several results of this type, such as the Szemeredi-Trotter theorem, over the reals and over finite fields and discuss their applications in combinatorics (e.g., in the recent solution of Guth and Katz to Erdos’ distance problem) and in computer science (in explicit constructions of multi-source extractors). (2) Kakeya type problems: These problems deal with arrangements of lines that point in different directions. The goal is to try and understand to what extent these lines can overlap one another. We will discuss these questions both over the reals and over finite fields and see how they come up in the theory of randomness-extractors. (3) Sylvester-Gallai type problems: In this type of problems, one is presented with a configuration of points that contain many `local’ dependencies (e.g., three points on a line) and is asked to derive a bound on the dimension of the span of all points. We will discuss several recent results of this type, over various fields, and see their connection to the theory of locally correctable error-correcting codes. Throughout the different parts of the survey, two types of techniques will make frequent appearance. One is the polynomial method, which uses polynomial interpolation to impose an algebraic structure on the problem at hand. The other recurrent techniques will come from the area of additive combinatorics.

💡 Research Summary

The survey “Incidence Theorems and Their Applications” provides a comprehensive overview of three major families of incidence‑type problems—counting incidences, Kakeya‑type configurations, and Sylvester‑Gallai‑type dependencies—and demonstrates how recent breakthroughs in these areas have been leveraged in combinatorics, theoretical computer science, and coding theory.

The first part focuses on the classic problem of bounding the number of incidences between a set of points P and a set of lines L. The authors revisit the Szemerédi‑Trotter theorem for the Euclidean plane, which gives the optimal bound O(|P|^{2/3}|L|^{2/3}+|P|+|L|). They explain the modern polynomial method proof, emphasizing how one constructs a low‑degree polynomial that vanishes on all incidences and then uses algebraic geometry to limit the number of possible zeroes. The discussion then moves to finite fields, where the analogous bound takes the form O(|P||L|/q + O(q)), reflecting the limited number of directions in 𝔽_q^2. The survey highlights the pivotal role of these incidence bounds in the Guth‑Katz solution to Erdős’s distinct‑distance problem, showing how a three‑dimensional “non‑collinear” polynomial construction reduces the distance count to near‑optimal levels.

The second section surveys Kakeya‑type problems, which ask how small a set can be while still containing a line in every direction. In the real setting, Besicovitch sets demonstrate that arbitrarily small measure is possible, yet the Hausdorff dimension must be full (n in ℝ^n). Over finite fields, Dvir’s celebrated result proves that any Kakeya set must have size at least c·q^n, using a clever application of the polynomial method: a low‑degree polynomial that vanishes on the set would have too many zeros unless the set is large. The authors connect these geometric lower bounds to randomness extraction, explaining how direction‑rich line families are used to construct multi‑source extractors and to analyze the seed length of non‑linear extractors.

The third part deals with Sylvester‑Gallai configurations. The classical Sylvester‑Gallai theorem states that a finite non‑collinear point set in the plane must contain an “ordinary line” passing through exactly two points. Modern extensions consider point sets over ℂ, ℝ, and finite fields that contain many local dependencies (e.g., many triples on a line) and derive global dimension bounds for the span of all points. The survey presents recent algebraic proofs that translate the abundance of collinear triples into a low‑rank condition on a matrix of coefficients, yielding a bound on the ambient dimension. A particularly striking application is the link to locally correctable codes (LCCs): the same combinatorial structure that forces a small ambient dimension also limits the rate‑distance trade‑off of LCCs. The work of Barak, Dvir, Wigderson, and Zhang is discussed in detail, showing how Sylvester‑Gallai type theorems provide tight lower bounds for the length of LCCs with a given locality.

Throughout the paper, two methodological pillars recur. The polynomial method supplies an algebraic scaffold that converts geometric incidence constraints into degree‑and‑zero‑set arguments. Additive combinatorics supplies tools such as sum‑set estimates, energy arguments, and growth lemmas that are essential for handling finite‑field versions and for establishing lower bounds. By intertwining these techniques, the authors illustrate a unifying framework that can address seemingly disparate problems—from bounding distances in point sets to constructing explicit randomness extractors and designing efficient error‑correcting codes.

Finally, the survey outlines several open directions: improving incidence bounds in higher dimensions, extending finite‑field Kakeya lower bounds to more general algebraic varieties, and tightening the connection between Sylvester‑Gallai configurations and the parameters of locally correctable and locally decodable codes. The authors argue that progress on any of these fronts will likely generate new tools for algorithm design, complexity theory, and information theory, underscoring the deep and productive interplay between incidence geometry and theoretical computer science.