English

On sets with few distinct distances

Metric Geometry 2016-11-17 v2 Combinatorics Number Theory

Abstract

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify this idea. Firstly, improving on a result of Hanson (see arXiv:1607.03442), it is proven that if P=A×AP= A \times A with ARA \subset \mathbb R and PP determines O(A2)O(|A|^2) distinct distances, then AA=O(A2211)|A-A|=O\left(|A|^{2-\frac{2}{11}}\right). This result gives further evidence that cartesian products which determine few distinct distances have some additive structure. Secondly, it is shown that if a set PR2P \subset \mathbb R^2 of NN points determines O(N/logN)O(N/\sqrt {\log N}) distinct distances, then there exists a reflection R\mathcal R and a set PPP' \subset P with P=Ω(log3/2N)|P'| =\Omega ( \log^{3/2} N) such that R(P)P\mathcal R(P') \subset P. In other words, sets with few distinct distances have some degree of reflexive symmetry.

Keywords

Cite

@article{arxiv.1608.02775,
  title  = {On sets with few distinct distances},
  author = {Oliver Roche-Newton},
  journal= {arXiv preprint arXiv:1608.02775},
  year   = {2016}
}
R2 v1 2026-06-22T15:15:47.462Z