The Setting
Let be a set of points in the Euclidean plane , with the Euclidean distance . Erdős’s pinned distance problem looks for a point of that determines many distinct distances to the other points; a point that determines few has circles centered at it that carry many points of . Fix an exponent . How many of the ordered pairs of distinct points of can be rich, that is, have at least points of other than on the circle centered at through , once is large? The set is arbitrary: its points need not be in general position or separated from one another.
Rich Pairs and Their Fraction
Fix a finite set of points of the plane and write . The distance fiber of an ordered pair of points of the plane in is the set of points of other than whose distance from is .✦ The pinned distance multiplicity of in is the number of points in the distance fiber of in : (1)✦
For a real number , the set of -rich ordered pairs of is the set of ordered pairs of distinct points of whose multiplicity is at least : (2)✦
The rich pair fraction of at exponent is the share of -rich pairs among the ordered pairs of distinct points of : (3)✦
For a natural number and a real number , the maximal rich pair fraction is the supremum of over the sets of points of the plane when , and when : (4)✦
The Claim
Theorem 1 (Weak pinned distance theorem). Let be a positive real number and let . Then there is a natural number such that every set of points of the plane has rich pair fraction at most : (5)✦ Equivalently, the maximal rich pair fraction at exponent tends to zero as the number of points grows: (6)✦
What Is Checked
The claim is stated over finite sets of points of the Euclidean plane , through the pinned distance multiplicity of (1), the -rich ordered pairs of (2), the rich pair fraction of (3) and its supremum over sets of points, (4).