Geometric Sidon Problems
arXiv:2606.05841
Abstract
This paper considers geometric problems of the following type: given a point set , one seeks a large subset avoiding a prescribed geometric configuration. Our main result states that, for any , there exists a subset with such that all of the distances determined by 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.