Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Use the definitions in L143 and write . Fix with exactly split classes and orthonormal coordinates in which , . Then . In a class that is not -split, and are both constant, so all its pairs have the same absolute displacements, say .
If all points lie on one vertical line, every displacement is vertical. Each class is then a union of vertical paths with at most pairs, and the distances from the lowest point give , which implies the claim. Otherwise let the abscissae fill with , let points lie on the middle line , and choose with abscissae and .
An unsplit class with has at most pairs. A neighbor of in it lies at , and the abscissae and cannot both lie in because they differ by . So has neighbors in one column only, at most two of them, and a graph of maximum degree two on vertices has at most edges. An unsplit class with consists of vertical pairs of one length. On each vertical line every point has at most one neighbor above and one below, so the class is a union of paths and has at most pairs.
For each point strictly right of the middle line, consider the class of ; for each point strictly left, the class of . These pairs have . If such a class is unsplit, it is rare by the preceding paragraph. If it is split, lies on one of at most circles about , or about , with split radii, so at most of the off-middle points meet a split class. An unsplit class with absolute displacements is reached from only by and from only by , so by at most four of these points. This gives at least rare classes, all with .
If , let be the lowest middle point. The vectors from to the other middle points are vertical with distinct lengths, and each split length is attained by only one of them. Their unsplit classes have and are rare, which gives at least further rare classes. They differ from the classes of the previous paragraph, whose common is positive. Therefore
For this implies the claim. For the right side is at least .
The argument uses only the classes met from the two extreme anchors, so the same count holds with replaced by the number of off-middle points whose anchor class is -split, for any one .