Erdős distance problem

Erdős distance problem
Name	Erdős distance problem
Field	Combinatorics, Discrete geometry, Graph theory
Introduced	1946
Introduced by	Paul Erdős
Notable results	Guth–Katz theorem
Related	Szemerédi–Trotter theorem, Falconer conjecture, Unit distance problem

Erdős distance problem The Erdős distance problem asks for the minimum number of distinct distances determined by N points in the Euclidean plane, and it sits at the nexus of Paul Erdős's combinatorial questions and modern Geometric measure theory methods. The problem spurred connections among Szemerédi, Trotter, Johns Hopkins University-adjacent researchers, and later breakthroughs by teams including Larry Guth and Nets Katz. It has influenced work across Additive combinatorics, Incidence geometry, Harmonic analysis, and Computational geometry.

Statement of the problem

Given a finite set of N points in the Euclidean plane, the problem asks: what is the asymptotic lower bound, as N → ∞, for the number of distinct distances determined by pairs of these points? Paul Erdős conjectured a near-optimal bound and posed variants for higher-dimensional Euclidean spaces and discrete subsets of Riemannian manifolds. The question contrasts extreme configurations such as subsets of a square lattice or points on a circle with more uniformly distributed sets like those arising in random matrix theory-inspired point processes.

Historical background and motivation

Paul Erdős raised the problem in 1946, motivated by earlier investigations into unit distances and combinatorial geometry by figures including Pál Turán and Erdős–Anning theorem-adjacent inquiries. Early lower bounds were established via combinatorial counting methods related to work of László Fejes Tóth and combinatorialists connected to Hungarian school traditions. Interest surged as connections to the Szemerédi–Trotter theorem and Beck's theorem emerged, linking distinct distances to incidence counts between points and lines, and to problems studied by researchers at institutions such as Princeton University, Massachusetts Institute of Technology, and University of Cambridge.

Progress and major results

Erdős originally conjectured a lower bound of roughly N / sqrt(log N) for the plane; subsequent improvements produced polynomial lower bounds. Techniques by Moser and Erdős gave early estimates; Chung and Szemerédi contributed combinatorial refinements. A landmark result came with the Guth–Katz theorem, which proved an almost optimal lower bound of N / log N in the plane using tools from Algebraic geometry, Incidence geometry, and Polynomial method. The Guth–Katz work built on earlier advances by Noga Alon, Béla Bollobás, and researchers from Institute for Advanced Study. Higher-dimensional analogues were studied by Valtr, Solomon Golomb-adjacent researchers, and connections to the Falconer conjecture linked continuous analogues studied by analysts such as Kenneth Falconer.

Methods and techniques

Major techniques include the polynomial partitioning method of Guth and collaborators, combinatorial incidence bounds exemplified by the Szemerédi–Trotter theorem, and algebraic tools from Algebraic geometry employed to control multiplicities of incidences. Additive combinatorics tools trace back to work by Endre Szemerédi and Ben Green; harmonic-analytic approaches connect to work by Jean Bourgain and Terry Tao. Combinatorial geometry methods inspired by Paul Erdős and George Szekeres interact with rigidity and graph-theoretic perspectives developed in Extremal graph theory by Paul Turán and Paul Erdős collaborators. Computational approaches and explicit constructions often draw on lattice theory related to Gauss and enumerative techniques from John Conway-adjacent research.

Variants and generalizations

Variants include the unit distance problem, studied by Leo Moser and later by Branko Grünbaum-adjacent researchers, the pinned distance problem investigated by authors connected with Ben Green and Igor Shparlinski, and continuous analogues such as the Falconer distance problem addressed by Kenneth Falconer and analysts like Wolff. Extensions consider higher dimensions involving work by Elekes and Rónyai, or incidence problems on algebraic varieties studied by researchers at École Polytechnique and University of Chicago. Algorithmic generalizations arise in computational geometry contexts studied at Stanford University and Carnegie Mellon University.

Open problems and conjectures

Remaining challenges include closing the polylogarithmic gap in the plane between known lower bounds and conjectured optimal bounds inspired by Erdős's original heuristics, sharpening higher-dimensional bounds beyond trivial projections, and resolving pinned-distance and finite-field analogues studied by Jean Bourgain and Mark Rudelson-adjacent researchers. Connections to the Falconer conjecture and to problems in Geometric measure theory and Additive combinatorics suggest further interplay among teams at institutions like Microsoft Research, Clay Mathematics Institute, and national academies. Understanding extremal configurations—whether lattice-like sets or algebraic curves produce near-minimal distance sets—remains a central open direction.

Category:Combinatorial geometry