pith. sign in

arxiv: 2303.17186 · v2 · pith:K4R67WJ4new · submitted 2023-03-30 · 🧮 math.CO

Structure of cell decompositions in Extremal Szemer\'edi-Trotter examples

classification 🧮 math.CO
keywords szemeredi-trotterrecipecellconfigurationdecompositionsexamplesextremal
0
0 comments X
read the original abstract

The symmetric case of the Szemer\'edi-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\'edi 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\'edi-Trotter examples. We obtain analogous results for unit circles.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An incomplete attack on the upper bound of the unit distance problem

    math.GM 2026-05 unverdicted novelty 2.0

    An incomplete attempt to show that the O(n^{4/3}) upper bound for unit distances among n points in the plane is not sharp, plus remarks on Szemerédi-Trotter incidences.