On distinct distances and λλ-free point sets

It is generally believed that the minimum number of distinct distances determined by a set of nn points in the Euclidean space is attained by sets having a very regular grid-like structure: for instance nn equidistant points on the line, or a n×n section of the integer grid in the plane. What happens if we perturb the regularity of the grid, say by not allowing two points together with their midpoint to be in the set? Do we get more distances in a set of nn points? In particular, is this number linear for such a set of nn points in the plane? We call a set of points midpoint-free   if no point is the midpoint of two others. More generally, let λ∈(0,1)λ∈(0,1) be a fixed rational number. We say that a set of points PP is λλ-free   if for any triple of distinct points a,b,c∈Pa,b,c∈P, we have λa+(1−λ)b≠cλa+(1−λ)b≠c.We first make a investigation of midpoint-free (more generally λλ-free) sets on the line with respect to the number of distinct distances determined by a set of nn points and provide such estimates. Other related distance problems are also discussed, including possible implications of obtaining good estimates on the minimum number of distinct distances in a λλ-free point set in the plane for the general problem of distinct distances in the plane.