2000 character limit reached
A note on distinct distances
Published 29 Feb 2016 in math.MG, cs.CG, and math.CO | (1603.00740v2)
Abstract: We show that, for a constant-degree algebraic curve in , every set of points on spans at least distinct distances, unless is an {\it algebraic helix} (see Definition 1.1). This improves the earlier bound of Charalambides [Discrete Comput. Geom. (2014)]. We also show that, for every set of points that lie on a -dimensional constant-degree algebraic variety in , there exists a subset of size at least , such that spans distinct distances. This improves the earlier bound of of Conlon et al. [SIAM J. Discrete Math. (2015)]. Both results are consequences of a common technical tool, given in Lemma 2.7 below.
Paper Prompts
Sign up for free to create and run prompts on this paper.