Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Two consecutive long-diagonal families force regularity
Lemma. Let , and let be the vertices of a strictly convex polygon in counterclockwise order. If, for every ,
then the polygon is regular. Indices are modulo .
These are the two largest cyclic separations, not an assumption that they are already the two largest numerical distances.
Proof. Let be the angle at between the rays to and . Consider the triangles . At a given vertex, its two appearances as a base vertex contribute its polygon interior angle plus : their angular intervals cover the interior angle and overlap precisely in . Adding their angles, including the apex appearances, gives
Reindex by . This visits every vertex because . Its consecutive edges all have length , and its three-step chords all have length , since . Its positive turns are the numbers in permuted order. Thus
Expanding the squared length of three successive edges gives
Subtracting consecutive equations and dividing by yields
The angle ranges imply either or . The latter would make three of the positive quantities sum to , contradicting (2), since leaves other positive terms. The turns are therefore two-periodic. Since is odd, all turns are equal, necessarily . Equal edge lengths and equal turns make a regular star polygon; its vertex set, and hence the original polygon, is regular.
Scope and remaining gap
The author checked the angle-sum identity, star orientation, the cosine alternatives, and the odd-period argument; the argument is author-recorded. No premise here follows from merely having many rich distance classes. In particular, richness has not supplied spanning cycles with these prescribed cyclic separations. This lemma therefore does not resolve either unrestricted question in Problem 132.
The constant-width inverse theorem uses a related local isometry-propagation mechanism, but obtains its compatible rows only under a bounded distance-count excess on a constant-width boundary.
The parity restriction cannot be removed. The even-order deformation construction has both largest cyclic separation classes uniform, attains the exact second-distance bound after adding its inner points, and has no five concyclic points. Thus extracting those two families at even order would not prove circularity.