On the unit distance problem

TL;DR

This paper improves bounds on the number of point pairs at a fixed small distance in well-distributed sets, extending results to higher dimensions and exploring a variant involving integer distances.

Contribution

It introduces improved bounds for the Erdős unit distance problem under specific conditions and extends the analysis to higher dimensions and a new integer distance variant.

Findings

Improved bounds for well-distributed sets with small fixed distances.

Extension of results to higher-dimensional spaces.

Initial results and conjectures for the integer distance variant.

Abstract

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known bound is $Cn^{\frac{4}{3}}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $\frac{4}{3}$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and using a continuous-to-discrete conversion mechanism. The degree of sharpness of results is tested using the known results on the distribution of lattice points dilates of convex domains. We also introduce the following variant of the Erd\H os unit distance problem: how many pairs of points from a set of size $n$ are separated by an integer distance? We obtain some results in this direction and formulate a conjecture.