This post is about a distinct distances problem which I think is quite interesting. As we shall see, solving this problem would also lead to significant progress in characterizing point sets with a small number of distinct distances. Recall that a perpendicular bisector of two points is the line that consists of the points satisfying (where is the distance between and ). For brevity, we will simply refer to these as bisectors.
We say that a set of points in has no repeated bisectors if for every four distinct points the bisector of and is not identical to the bisector of and (that is, the configuration in the above figure is forbidden).
Conjecture. Let be a set of points in with no repeated bisectors. Then for any the points of determine distinct distances, .
For some initial intuition, consider the point sets that determine a small number of distinct distances. I am only aware of two types of configurations that yield distinct distances: the vertices of a regular -gon and lattices.
We can also play a bit with these examples. For example, by taking two regular -gons whose vertices are on two concentric circles, or by taking evenly spaced points on a line (that is, an lattice). All of these examples have a significantly large amount of repeated bisectors.
So far I only managed to find a set with no repeated bisectors and distinct distances. From the other direction, I can only show that every such set determines distinct distances. This is unfortunate, since a stronger bound for this problem would lead to a breakthrough in characterizing planar point sets that determine a small number of distinct distances. Below I describe how this can be done, and also how to obtain simple lower and upper bounds for this problem.
Upper bound. We first describe a slightly sub-quadratic upper bound for the problem. This is a variant of a bound by Dumitrescu. First, recall that an section of the integer lattice determines (e.g., see here). For a prime , we consider the set . We work , so the -coordinates are actually . Since this is a subset of an section of the integer lattice, the number of distinct distances that are determined by is . If two pairs of points define the same bisector, then all four points are on a common circle. Dumitrescu showed that no four points of are on a common circle. Thus, has no repeated bisectors.
Lower bound. We now discuss the (straightforward) lower bound for the problem. Let be a set of points with no repeated bisectors, and let be the number of distinct distances determined by . We set . That is, is the number of isosceles triangles with vertices in (where an equilateral triangle is counted three times). A simple Cauchy-Schwarz argument implies (e.g., see Lemma 3.1 in this survey). On the other hand, a triple is in if and only if the perpendicular bisector of and is incident to . Since there are points and bisectors, the Szemerédi–Trotter theorem implies that there are incidences. This is not true for arbitrary point sets, since the bisectors might not be distinct, in which case we cannot apply the Szemerédi–Trotter theorem. In our case this argument works because there are no repeated bisectors. That is, we have . Combining this with the above lower bound for implies , as asserted.
It is not surprising that it is difficult to obtain a bound of distinct distances, since this is actually a more general variant of an existing distinct distances problem with no non-trivial bounds for it. Specifically, Erdős asked for the minimum number of distinct distances that a point set can determine if every four points of the set determine at least five distances (for more details about this problem and related ones, see this older post). Even though the point set is more restricted in this older problem, which has been mentioned in several places over the past several decades, no non-trivial bound is known for it (Larry Guth recently pointed out this observation to me).
Reduction. One of the main open problems concerning distinct distances is characterizing the point sets in that determine distinct distances. I already discussed this problem in detail in a previous post. Let me just mention that the first step towards solving the problem seems to be proving the following claim: If an -point set determines distinct distances, then there exists a line that contains point of . Embarrassingly, so far we only know how to prove the existence of a line with points of on it.
In a paper by Ben Lund, Frank de Zeeuw, and myself, we studied the bisector energy of a point set . This is the quantity
In this definition, we do not count quadruples where is the same pair as . That is, it is possible to have . In the paper we prove that if no line or circle contains points of , then for any for any we have .
Assume for contradiction that there exists an -point set with distinct distances and with no line or circle containing points of . The aforementioned result implies that . Let and let be a set that is obtained by taking each point of with probability . By a standard probabilistic argument we obtain that there exists such a subset satisfying (we omit the straightforward calculation). Let be the set obtained by removing from an arbitrary point from each quadruple that contributes to . That is, is a set of points of with no repeated bisectors.
This leads to the above conjecture. Specifically, if every -point set with no repeated bisectors determines distinct distances, then determines distinct distances. This would contradict the assumption that determines distinct distances, and imply that there must exist a line or a circle that contains points of .
While the above argument requires the rather strong bound of distinct distances, a weaker bound may also suffice. This is because the aforementioned upper bound seems far from tight (we conjecture that the correct bound is ). Improving this bound would lead to weaker requirements for the number of distinct distances.