On the structure of extremal point-line arrangements
Gabriel Currier, Jozsef Solymosi, Hung-Hsun Hans Yu

TL;DR
This paper demonstrates that extremal point-line arrangements with many incidences are highly rigid, meaning a small subset of points can determine a large part of the configuration, using polynomial partitioning and rigidity results.
Contribution
It establishes the rigidity of extremal Szemerédi-Trotter configurations, showing that a small set of points fixes a large portion of the arrangement.
Findings
Extremal configurations are determined by a small subset of points.
Incidence structures exhibit rigidity, constraining possible arrangements.
Uses polynomial partitioning and prior rigidity results to prove the main theorem.
Abstract
In this note, we show that extremal Szemer\'{e}di-Trotter configurations are rigid in the following sense: If are sets of points and lines determining at least incidences, then there exists a collection of points of size at most such that, heuristically, fixing those points fixes a positive fraction of the arrangement. That is, the incidence structure and a small number of points determine a large part of the arrangement. The key tools we use are the Guth-Katz polynomial partitioning, and also a result of Dvir, Garg, Oliveira and Solymosi that was used to show the rigidity of near-Sylvester-Gallai configurations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Mathematical Approximation and Integration · Optimization and Packing Problems
