A Construction for Difference Sets with Local Properties
Abstract
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set A of n real numbers such that |A-A|=n2 3 and that every subset A'⊂eq A of size k satisfies |A'-A'| k2 3. This construction leads to the first non-trivial upper bound for the problem of distinct distances with local properties.
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.