On sets with few distinct distances

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 × A with A ⊂ R and P determines O(|A|2) distinct distances, then |A-A|=O(|A|2-211). 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 P ⊂ R2 of N points determines O(N/ N) distinct distances, then there exists a reflection R and a set P' ⊂ P with |P'| = ( 3/2 N) such that R(P') ⊂ P. In other words, sets with few distinct distances have some degree of reflexive symmetry.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…