Structure of cell decompositions in Extremal Szemerédi-Trotter examples
Abstract
The symmetric case of the Szemerédi-Trotter theorem says that any configuration of N lines and N points in the plane has at most O(N4/3) incidences. We describe a recipe involving just O(N1/3) parameters which sometimes (that is, for some choices of the parameters) produces a configuration of N point and N lines. (Otherwise, we say the recipe fails.) We show that any near-extremal example for Szemerédi Trotter is densely related to a successful instance of the recipe. We obtain this result by getting structural information on cell decompositions for extremal Szemerédi-Trotter examples. We obtain analogous results for unit circles.
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.