The Setting
Take points in the plane and pin one of them, . The other points sit on circles centered at , one circle for each distance that sees. Erdős’s pinned distance problem asks whether every configuration has a pin that sees nearly distinct distances.
Two shares of a configuration bear on this: the share of ordered pairs for which the circle about through carries many points, and the share of pins that see few distances. The library defines both, with “many” and “few” measured against powers of , and takes the supremum of each over all -point configurations.
The Definition
Definition 1. The plane is the space of pairs of real numbers with the Euclidean distance (1)✦ A configuration is a finite set , and throughout.
For points and of the plane, the distance fiber of about in is the set of points of other than whose distance from is : (2)✦ The fiber size is the number of points of : (3)✦
For a real number , the set of rich pairs of is the set of ordered pairs of distinct points of whose distance fiber has at least points: (4)✦ The rich pair fraction of is the number of rich pairs divided by the number of ordered pairs of distinct points: (5)✦ For a natural number and a real number , the maximal rich pair fraction is the supremum of over the -point configurations when , and when : (6)✦
For a point of the plane, the distance set is the set of distances from to the points of other than : (7)✦ For a real number , the set of bad pins of is the set of points whose distance set has fewer than elements: (8)✦ The bad pin fraction of is the number of bad pins divided by the number of points: (9)✦ For a natural number and a real number , the maximal bad pin fraction is the supremum of over the -point configurations when , and when : (10)✦
In the paper, the definitions read: for a finite set and , ; for distinct , ; and for and , is the supremum over -point sets of .
What Is Checked
The definitions are stated over finite sets of points of the Euclidean plane (1), over arbitrary points and of the plane for the distance fiber and the distance set, and over every natural number and all real and for and .