The Setting
Take a set of points in the plane and a point of , the pin. The other points of lie on circles about , and the distances the pin determines are the radii of these circles. The question, a weak form of the Erdős pinned distance problem, fixes an exponent and asks how large a fraction of the points of an -point set can be pins determining fewer than distinct distances, as grows.
Distances at a Pin
A configuration is a finite set of points in the Euclidean plane , and is its number of points. The distance set of a configuration at a point of the plane is the set of distances from to the points of other than : (1)✦
A bad pin of a configuration at a real exponent is a point whose distance set has fewer than elements.✦ For and real , the extremal bad fraction is the supremum, over all configurations of points, of the fraction of bad pins in , and : (2)✦
Rich Pairs
The multiplicity of points and of the plane in a configuration is the number of points of other than on the circle about through : (3)✦
An -rich pair of a configuration , for a real , is an ordered pair of distinct points of with .✦ For and real , the extremal rich-pair fraction is the supremum, over all configurations of points, of the number of -rich pairs of divided by , and for : (4)✦
The Claim
Theorem 1. For every , the extremal bad fraction tends to zero: (5)✦ For a real , all but a uniformly vanishing fraction of pins determine at least distinct nonzero distances: (6)✦ Let . Then there is an such that every configuration of points has a pin with (7)✦
In the paper, the result reads: for every fixed , as , and in particular every sufficiently large -point planar set has a pin determining at least distinct nonzero distances.
What Is Checked
The claim is stated over configurations in the Euclidean plane , through their distance sets (1) and the extremal bad fraction (2).
The library proves, about these constructions, that for a configuration and a point of the plane, every element of the distance set satisfies (8)✦ It also proves, for every and every real , a bound of the extremal bad fraction by the extremal rich-pair fraction at half the exponent: (9)✦