Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
All distances are rare on a constant-width boundary
This is a restricted geometric criterion, not a proof of either unrestricted assertion of Problem 132.
Boundary theorem
Theorem. If an -point set lies on the boundary of a planar convex body of constant width, then every occurring distance has at most unordered occurrences. Consequently
Let the body have width . It has diameter : project any chord onto its own direction for the upper bound, and use opposite support points for the lower bound. If has unit outward supporting normal , an opposite support point satisfies
so . Every support face is therefore a singleton (fixing uniquely fixes ), and is strictly convex.
Fix . We show that each circle centered at with radius meets in exactly two points. Suppose is a local extremum of distance from along the boundary. Let be its two one-sided unit tangent directions pointing away from , and put .
If the tangent cone has angle less than , strict convexity puts strictly inside it, so with . At a local minimum, one-sided differentiation gives , contradicting
At a local maximum the inequalities reverse, making an outward normal. If the tangent-cone angle is , then , and either type of extremum forces ; since is inside the supporting half-plane, is again outward. These one-sided tangents exist for the boundary of every planar convex body; no smoothness is used.
Thus at any nonzero local extremum, both and lie on the boundary. Strict convexity excludes , so the extremum has value . Parametrize the boundary from back to . Its -level set is an interval: a gap would contain a positive local minimum below . Before this interval the distance is strictly increasing, and afterward it is strictly decreasing; otherwise there would again be a nonzero local extremum below . This proves the two-intersection assertion.
Every distance consequently gives a graph of maximum degree two on , hence at most unordered edges. If occurs, apply the planar diameter theorem. This proves all-rarity. Finally gives .
Diameter-active points
Corollary. Let consist of the points of incident with a pair attaining its diameter . Every distance has maximum degree at most two on . If , all distances of are rare.
Here is a self-contained proof of the completion fact needed for the corollary. Choose, by maximality under inclusion, a diameter- set containing . The union of a chain of admissible sets remains admissible, so Zorn's lemma applies. Closure and convex hull do not increase diameter; hence is compact and convex. It has interior: a segment or point can be enlarged without increasing its positive diameter. Maximality also gives
At , let
It is nonempty by compactness and (1). Its vectors have length and pairwise angles at most , because . Every outward supporting normal at belongs to their positive cone. Otherwise separation supplies with and for all . Perturb slightly toward an interior point of to make all the latter inequalities strictly negative. Compactness then shows that belongs to every disk in (1) for sufficiently small : nearly active disks have negative first derivative, and the remaining disks have uniform slack. This contradicts the supporting inequality in direction .
Normalize to length one. In the plane it lies between two extreme active normals . Their angle is at most . The point lies on the short radius- arc from to centered at . For every , both and are at most . The short-circle-arc lemma gives . By (1), . The width in direction is therefore ; the diameter bound supplies the reverse inequality. Thus has constant width.
Every diameter-active point lies on : an interior point at distance from another point could be moved slightly farther away while remaining in . The boundary theorem now proves the corollary.
Scope and checks
The argument was checked for nonsmooth boundaries, the possible diametral arc, and unordered multiplicities. The maximal-set completion argument was also checked by the author and is author-recorded. It gives no bound for distance edges touching the points outside . Bounded rarity has not been shown to force , or even all but a bounded number of points into .