Geometric Sidon Problems
Abstract
This paper considers geometric problems of the following type: given a point set P ⊂ R2, one seeks a large subset avoiding a prescribed geometric configuration. Our main result states that, for any P ⊂ R2, there exists a subset P' ⊂ P with |P'| |P|1/3 such that all of the distances determined by P' are distinct. This improves a result of Charalambides. We make heavy use of a result of Li and Postle concerning the independence number of hypergraphs which satisfy some edge distribution conditions, as well as tools from incidence geometry.
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.