Wiki
Wiki

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 κ=κ(A)\kappa=\kappa(A). Fix SS with exactly κ\kappa split classes and orthonormal coordinates in which S=λdiag⁡(1,−1)S=\lambda\operatorname{diag}(1,-1), λ≠0\lambda\ne0. Then dTSd=λ(dx2−dy2)d^{\mathsf T}Sd=\lambda(d_x^2-d_y^2). In a class that is not SS-split, dx2−dy2d_x^2-d_y^2 and dx2+dy2d_x^2+d_y^2 are both constant, so all its pairs have the same absolute displacements, say (a,b)(a,b).

If all points lie on one vertical line, every displacement is vertical. Each class is then a union of vertical paths with at most n−1n-1 pairs, and the distances from the lowest point give R(A)≥n−1R(A)\ge n-1, which implies the claim. Otherwise let the abscissae fill [m,M][m,M] with W=M−m>0W=M-m>0, let cc points lie on the middle line x=(m+M)/2x=(m+M)/2, and choose pL,pR∈Ap_L,p_R\in A with abscissae mm and MM.

An unsplit class with a>W/2a>W/2 has at most nn pairs. A neighbor of vv in it lies at v+(±a,±b)v+(\pm a,\pm b), and the abscissae xv+ax_v+a and xv−ax_v-a cannot both lie in [m,M][m,M] because they differ by 2a>W2a>W. So vv has neighbors in one column only, at most two of them, and a graph of maximum degree two on nn vertices has at most nn edges. An unsplit class with a=0a=0 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 n−1n-1 pairs.

For each point zz strictly right of the middle line, consider the class of ∣z−pL∣|z-p_L|; for each point strictly left, the class of ∣z−pR∣|z-p_R|. These pairs have ∣dx∣>W/2|d_x|>W/2. If such a class is unsplit, it is rare by the preceding paragraph. If it is split, zz lies on one of at most κ\kappa circles about pLp_L, or about pRp_R, with split radii, so at most 2κM(A)2\kappa M(A) of the n−cn-c off-middle points meet a split class. An unsplit class with absolute displacements (a,b)(a,b) is reached from pLp_L only by pL+(a,±b)p_L+(a,\pm b) and from pRp_R only by pR+(−a,±b)p_R+(-a,\pm b), so by at most four of these points. This gives at least (n−c−2κM(A))/4(n-c-2\kappa M(A))/4 rare classes, all with a>W/2a>W/2.

If c≥2c\ge2, let z0z_0 be the lowest middle point. The c−1c-1 vectors from z0z_0 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 a=0a=0 and are rare, which gives at least c−1−κc-1-\kappa further rare classes. They differ from the classes of the previous paragraph, whose common aa is positive. Therefore

R(A)≥max⁡{0,n−c−2κM(A)4}+max⁡{0,c−1−κ}.R(A)\ge\max\Bigl\{0,\frac{n-c-2\kappa M(A)}{4}\Bigr\}+\max\{0,c-1-\kappa\}.

For c=0c=0 this implies the claim. For c≥1c\ge1 the right side is at least (n+3c−4−2κM(A)−4κ)/4≥(n−1−2κ(M(A)+2))/4(n+3c-4-2\kappa M(A)-4\kappa)/4\ge(n-1-2\kappa(M(A)+2))/4. □\square

The argument uses only the classes met from the two extreme anchors, so the same count holds with 2κM(A)2\kappa M(A) replaced by the number of off-middle points whose anchor class is SS-split, for any one SS.