On the structure of planar point sets that determine few distinct distances

Joshua Zahl
Massachusetts Institute of Technology

The recent breakthrough by Guth and Katz on the Erdos distinct distance problem in the plane has generated great interest in related distance questions. One line of inquiry concerns the structure of point sets that determine very few distinct distances. In this direction, Erdos conjectured that point sets determining few distinct distances must have a "lattice" structure. While this conjecture is still far out of reach, I will discuss some recent results on the structure of these sets.

Back to Workshop I: Combinatorial Geometry Problems at the Algebraic Interface