Simple Proofs of Classical Theorems in Discrete Geometry via the Guth--Katz Polynomial Partitioning Technique

2011/02/26 by Kaplan, Haim, Matoušek, Jiří, Sharir, Micha · 1 citation
#52C10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1102.5391

Abstract

Recently Guth and Katz \citeGK2 invented, as a step in their nearly complete solution of Erdős's distinct distances problem, a new method for partitioning finite point sets in \R^d, based on the Stone--Tukey polynomial ham-sandwich theorem. We apply this method to obtain new and simple proofs of two well known results: the Szemerédi--Trotter theorem on incidences of points and lines, and the existence of spanning trees with low crossing numbers. Since we consider these proofs particularly suitable for teaching, we aim at self-contained, expository treatment. We also mention some generalizations and extensions, such as the Pach--Sharir bound on the number of incidences with algebraic curves of bounded degree.

Cited by

• Incidences among flows

Related

• On cliques in three-dimensional dense point-line arrangements
• Incidence Theorems and Their Applications
• Distinct distance estimates and low degree polynomial partitioning
• On the structure of extremal point-line arrangements
• On the Erdos distinct distance problem in the plane