Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Let be a finite set of distinct points. List its distinct positive occurring distances as . For , let be the simple graph on whose edges are the unordered pairs at distance . Write and for the degree of . Thus
Indeed, an edge has two different endpoints and contributes one to each endpoint's degree. The graphs for different have disjoint edge sets. Assertions involving require that it occurs; the two-distance theorems assume . We do not assign a nonexistent second distance the value zero.
Source. K. Vesztergombi, Bounds on the number of small distances in a finite planar set, Studia Scientiarum Mathematicarum Hungarica 22 (1987), 95--101, definitions on printed p. 95 (physical PDF p. 101). The whole-volume edition read is identified on the source card; the article occupies physical pp. 101--107. All result pages in this source unit use that edition.
Elementary circle facts. On a circle of radius , points separated by a minor central angle have chord length . This follows by bisecting the isosceles triangle from the center; it is strictly increasing in on this interval. We use degrees when writing angles such as , and radians in analytic formulas involving .
In the two-distance setting normalize and put . Every positive distance below between points of must equal . Consequently any circular arc of angle strictly less than on a unit circle contains at most two points of . Otherwise, in their order along the arc, the first point has different positive distances less than to the second and third. More generally, if points on that circle have minimum separation at least , their minor angular separations are at least .
For points of radii about the same center and minor angular separation , the squared distance is , by expanding their Cartesian coordinates. These facts, finite counting and elementary trigonometric identities suffice for the local proofs here; no external theorem-level premise is imported.
Verification scope. These definitions and elementary deductions were independently checked against the published source. The final review retains that check as part of the Verified at the stated scope proof records on the [[distance_problems/vesztergombi_1987_bounds_number_small_distances_finite_planar_set/theorem_p99|second-distance theorem]], [[distance_problems/vesztergombi_1987_bounds_number_small_distances_finite_planar_set/theorem_p100|two-distance theorem]] and [[distance_problems/vesztergombi_1987_bounds_number_small_distances_finite_planar_set/construction_pp99_100|hexagonal construction]]. Multiplicity counts are not counts of distinct values or counts below an arbitrary fixed threshold.