Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
A positive collinear or bounded-degree algebraic fraction forces rarity
These results do not resolve either unrestricted assertion of Problem 132. All multiplicities count unordered pairs. Write for the number of distinct positive distances.
A positive fraction on one line
Theorem. Fix . For all sufficiently large , if an -point planar set has at least points on one line, then
The proof first shows that forces onto fewer than parallel lines. This is a line version of the existing circle-incidence argument.
Uniform hyperbola overlap
Let be translates of an -element real set , and put . For any ,
For each , use the curve
The curves are irreducible conics, and their linear coefficients determine their translation parameters. Two distinct curves meet in at most two points: their equations subtract to a nonzero line, which cannot be a component of a nondegenerate hyperbola. Dually, the parameter equations for curves through two distinct points are two distinct translates of the same hyperbola, so at most two curves pass through two points.
The two-degrees-of-freedom crossing-lemma argument therefore gives
with an absolute constant, uniform in . One can use the elementary proof in circle_incidence: here each curve has just two simple branches, pairwise intersections and edge multiplicities are at most two, and there are no singular or coincident components.
Take and the displayed curves. Each solution counted by , and each parameter pair , give the incidence . These incidences are distinct. Substituting , and dividing by proves (1).
Pinned spectra and parallel lines
If , fewer than classes are rich by the pair budget, and hence . Assume .
Normalize the anchor line to the -axis and let be its point coordinates. Then
For , set
This pinned squared-distance spectrum has at least elements and is contained in the global squared-distance set with zero adjoined, of cardinality .
If and , a common value satisfies
Apply (1) to , . It follows that
Suppose distinct absolute heights occur. Choose one point at each height. Inclusion-exclusion and (2) give
contradicting for sufficiently large . Thus fewer than absolute heights occur. Since height zero occurs, all points lie on at most parallel lines. The proved parallel-line rank bound gives
This includes , for which every distance is rare and at least occur. The height-zero degeneracy in (2) is not used: each absolute height contributes at most two covering lines.
A positive fraction on a bounded-degree curve
Corollary. Fix and an integer . If a real algebraic curve of degree at most contains at least points of , then
Factor a defining polynomial over . There are at most nonconstant irreducible factors, so one component contains at least points. For a line component use the theorem above; for a circle use circle_incidence. For any other component, Theorem 1.1 of Pach--de Zeeuw gives . Since there are fewer than rich classes, this implies (3), in fact a superlinear lower bound in this last case.
The exact source input is J. Pach and F. de Zeeuw, Distinct distances on algebraic curves in the plane, Theorem 1.1, arXiv:1308.0177v4, PDF p. 2. Its statement was checked in the full paper: the constant depends only on the degree, and the excluded components are lines and circles. Thus the curve may vary with while its degree stays bounded.
In particular, a bounded-rarity sequence has points on every fixed-degree algebraic curve, uniformly over curves of that degree. The existing layer reduction still puts a positive fraction of its points in finitely many outer convex layers. No argument here forces one of those layers onto a bounded-degree curve.
Checks
The author checked the hyperbola degeneracies, incidence replication, inclusion-exclusion, and unordered-pair rank bound; the argument is author-recorded. Neither this criterion nor the curve theorem supplies the missing unrestricted structure theorem.