This post surveys yet another family of variants of the distinct distances problem, for my survey of open problems and best known bounds. I think that not too many variants are still missing.

Let denote the minimum number of distinct distances that are determined by a planar set of points with the property that any points of determine at least distinct distances (this notation is taken from Chapter 5 of Research Problems in discrete Geometry). That is, by having a local property of every small subset of points, we wish to obtain a global property of the entire point set. The following table lists the best known bounds for most of the problems that are discussed in this post.

Variant | Lower Bound | Upper Bound |
---|---|---|

## The case of

The value of is the minimum number of distinct distances that are determined by a set of points that do not span any equilateral triangles. As discussed in a previous post in the series, Erdős noticed that a integer lattice determines distinct distances. It is known that the points of the integer lattice do not determine any equilateral triangles, and thus . Guth and Katz’s bound for (i.e., the general planar distinct distances problem) implies . Thus, the best known bounds for are identical to the ones for .

**Problem 1.**

*Find the asymptotic value of .*

The value of is the minimum number of distinct distances that are determined by a set of points that do not span any isosceles triangles (here and in the following cases, we also consider degenerate polygons, such as a degenerate isosceles triangle whose three vertices are collinear). Since no isosceles triangles are allowed, every point determines distinct distances with the other points of the set, and thus we have . Erdős observed the following upper bound for . Behrend proved that there exists a set of positive integers , such that no three elements of determine an arithmetic progression and that . Therefore, the point set does not span an isosceles triangle. Since and , we have . Erdős conjectured that .

**Problem 2.**

*Find the asymptotic value of .*

## The case of

The value of is the minimum number of distinct distances that are determined by a set of points that do not span any squares. This case is somewhat similar to the one of . The triangular lattice determines distinct distances (as proved in this previous post). The triangular grid cannot contain any squares, and thus we have . The best known lower bound is implied by Guth and Katz’s bound.

**Problem 3.**

*Find the asymptotic value of .*

The value of is the minimum number of distinct distances that are determined by a set of points that do not span any Rhombuses, rectangles, or deltoids with one vertex that is equidistant to the three other three. For example, in the following figure the point is equidistant from the other three vertices the deltoid.

Dumitrescu observed that , by using the same point set from the analysis of . Consider a subset of four points of , as depicted in the following figure.

Notice that the only pairs of segments that are allowed to have the same length (without resulting in an arithmetic progression) are and . Thus, every quadruple of points determines at least four distinct distances. No lower bound is known beyond .

**Problem 4.**

*Find the asymptotic value of .*

Not much is known about the case of . Erdős asked whether , though the best known lower bound is only . Indeed, when considering an point set with this property, we notice that any circle whose center is a point of can be incident to at most two points of .

**Problem 5.**

*Find the asymptotic value of .*

Finally, we have the trivial bound , since every distance can occur at most once in this case.

## The case of

We do not go over all the cases of , and only mention that Erdős asked whether . Again, nothing is known in this case beyond the trivial .

**Problem 6.**

*Find the asymptotic value of .*

## The general case

Erdős noticed that, for any , we have . To see why, consider a set of points such that every -point subset of determines at least distinct distances, and a point . If is the center of a circle that is incident to points of , then together these points determine at most distinct distances, contradicting the assumption on . Thus, the points of are contained in at least circles around , which in turn implies that determines distinct distances with the other points of .

Another simple observation is that, for any , we have , since in this case every distance can occur at most times.

Finally, similarly to the cases of and , we can use the set to obtain a bound of for various . For example, it is not hard to show that . It seems likely that a more careful analysis would yield the same bound for larger values of .

Advertisements

Pingback: Distinct Distances for Sets with no Repeated Bisectors – Some Plane Truths