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(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2023
- DOI:
- arXiv:
- arXiv:2303.17186
- Bibcode:
- 2023arXiv230317186K
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 28 pages, 8 figures