Over the years, more and more interactions between Discrete Geometry and Additive Combinatorics are being exposed. These include results such as the Green–Tao ordinary lines theorem and Solymosi’s sum-product bound. One reason for this connection is that both fields study the structure and symmetries of various objects (such as sets of points or subsets of additive groups). In this post I will discuss one of the simplest connections between the two fields — studying the additive energy of a set of points in a real space . The main goal of the post is to present two open problems that involve the additive energy of such sets. I heard one of these problems from Nets Katz and the other from Ciprian Demeter. In future posts we might discuss more involved interactions between the two fields.

# Distinct Distances

# (More) Local Properties that imply Many Distinct Distances

Last year I wrote a post about a distinct distances problem that involves local properties of the point set. Specifically, let denote the minimum number of distinct distances that can be determined by a set of points, such that any points of determine at least distinct distances. That is, by assuming that the point set satisfies a local property, we wish to conclude the global property of many distinct distances. For more details and examples, see the original post.

A while ago I noticed another nice bound for this set of problems. Unfortunately the proof is very simple, which prevents it from being published in a “decent” journal. I’ve been trying to push it further, so far without success. Perhaps someone else would see how this idea can be extended.

As discussed in the previous post, Fox, Pach, and Suk proved that for every and , we have

A simple argument shows that for every we have

Our interest in this post lies in between these two bounds. That is, what happens between the values and . I am only aware of one previous result in thie range: Erdős and Gyárfás showed that . We will now prove a stronger result.

**Theorem 1.**

*For every that is divisible by four, we have*

# Distinct Distances for Sets with no Repeated Bisectors

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.

# Local Properties that imply Many Distinct Distances

Jacob Fox, Janos Pach, and Andrew Suk just placed this paper on arXiv. The paper seems very nice, but unfortunately for Ben Lund, Frank de Zeeuw, and myself, it contains a result that is almost identical to one that we had but did not yet publish. Instead of sulking alone in the dark, in this post I describe the problem and our result.

* Jacob Fox, Janos Pach, and Andrew Suk.*

Let denote the minimum number of distinct distances that can be determined by a set of points with the property that any points of determine at least distinct distances. That is, by assuming that the point set satisfies a local property, we wish to conclude the global property of many distinct distances.

For example, 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 (including degenerate triangles with three collinear vertices). Since no isosceles triangles are allowed, every point determines distinct distances with the other points of the set, and we thus 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 any isosceles triangles. Since and , we have .

In the same paper, Erdős derived the more general bound

As Fox, Pach, and Suk point out, a result by Sarkozy and Selkow implies the slightly stronger (with depending on )

We are now ready to state our result. The result of Fox, Pach, and Suk is identical up to the being replaced with . While there are some similarities between the two proofs, they do not seem to be identical.

**Theorem 1.**

*For every even and , we have*

# Point Sets with Few Distinct Distances

Ben Lund and I were sitting in a small Korean restaurant and discussing an old conjecture of Erdős. Erdős suggested that if a set of points in spans distinct distances, then the vertices of this set must span either a square or an equilateral triangle. Presumably, this conjecture was made because the two best-known examples of sets with distinct distances are subsets of the integer lattice and of the triangular lattice. (By the triangular lattice, I mean the vertices of a tiling of the plane with equilateral triangles.)

* A subset of the integer lattice and a subset of the triangular lattice.*

A subset of the integer lattice spans many squares and no equilateral triangles, while a subset of the triangular lattice spans many equilateral triangles and no squares. We can create various similar configurations by taking one of these two configurations and then applying rotations, uniform scaling, and taking subsets. Such configurations still contain squares or equilateral triangles. Ben and I were wondering whether we can find additional configurations, which are not “related” to the integer lattice or to the triangular lattice. Surprisingly, we managed to find a large family of other configurations. Moreover, many of these configurations do not span any squares or triangles, disproving Erdős’ conjecture. We then discovered that these configurations were already known, and appeared in a paper by Moree and Osburn. I guess that this is another case of lack of communication between different mathematical communities…

# Distinct Distances: Open Problems and Current Bounds

If you have been following this blog for a while, you might have noticed that I have been slowly surveying the various open problems that are related to distinct distances, and the best known bounds for them. I think that my survey is now in a decent shape, so I uploaded it on arXiv.

For this occasion, I wish to mention an open problem concerning surfaces in . It is far from being one of the main problems of this subfield. However, since currently no non-trivial bounds are known for it, it seems like a good problem for a student or for someone who wishes to start working on distinct distances problems.

Recall that in

*bipartite*distinct distances problems we have two sets of points and , and are interested only in distinct distances that are spanned by pairs of (i.e., distances between points from different sets). For simplicity, in this post we assume that both sets are of cardinality . One example of such a result, by Pach and de Zeeuw, is that if each of the two point sets is on a planar curve that contains no lines or circles, then the number of distinct distances between and isIn , the similar (yet non-bipartite) case where one point set is placed a curve was studied by Charalambides and by Raz, Sharir, and Solymosi. However,

*nothing non-trivial is known for point sets on two-dimensional surfaces*. That is, consider, in , the minimum number of distinct distances between a set of points on a two-dimensional surface , and a set of points on a two-dimensional surface .Before we properly formulate any questions for this scenario, let us first consider some examples. First, consider the case where and are non-parallel planes in . In this case there exist two orthogonal lines such that , , and is a point on . We can place the two sets of points on such that the number of distinct distances between the two sets is (e.g., see Section 3 of the survey). The same bound can be obtained between two spheres and between a sphere and a plane (in both cases by placing the points on two parallel circles).

A slightly better bound can be obtained in the case where and are parallel planes. In this case we can place a subset of the integer lattice on each of the planes. For example, we may assume that the planes are defined by and , and that the points of the two sets are

A variant of Erdős’ analysis of the planar lattice (e.g., see Section 2 of the survey) implies that the number of distinct distances between the two sets is .

Unlike the planar case, it is not immediately clear whether the above examples are tight. For example, the integer lattice determines only distinct distances. This leads to the following conjecture.

**Conjecture.**Given a set of points on a two-dimensional surface , and a set of points on a two-dimensional surface , both in , the number of distinct distances between the two sets is (or at least ?).

Assuming that the conjecture is true, we have the following natural question.

**Problem.**Characterize which pairs of surfaces can yield distinct distances. Moreover, provide a lower bound for the minimum number of distinct distances for the case of any other pair of surfaces.

This problem formulation is motivated by aforementioned result of Pach and de Zeeuw for the case of points on two planar curves, where the only “exceptional” cases are when the two curves contain parallel lines or concentric circles, and then the number of distinct distances can be . For any other pair of curves, the number of distinct distances is .

# The limitations of the Elekes-Sharir framework

In a previous series of posts, we discussed the Elekes-Sharir(-Guth-Katz) framework. By using this framework, Guth and Katz derived the bound for the Erdős distinct distances problem (where denotes the number of distinct distances that are determined by pairs of points from , and ). The best known upper bound is , which leaves a gap of . The common belief is that , and thus, that there should exist a way to strengthen the analysis of the lower bound.

In this post we briefly discuss the existence of point sets that determine distinct distances, for which the Elekes-Sharir framework can only yield a bound of . Such configurations imply that to improve the Guth-Katz lower bound while by relying on the Elekes-Sharir framework, one either has to make a drastic change in the framework, or to separately handle the family of “problematic” point configurations. ~~This observation is one of the results in a recent paper by Javier Cilleruelo, Micha Sharir, and myself.~~

*Embarrassingly, I did not notice that a similar result was added to the third version of Guth and Katz’s paper. The aforementioned paper still contains other interesting results.* Let us first recall the lower bound construction of Erdős. This construction relies on the following theorem from number theory.