Unit Distance Problems

Abstract

We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?

References in corpus (2)

• Some connections between Falconer's distance set conjecture, and sets of Furstenburg type
• On the Erdos distinct distance problem in the plane