A note on distinct distances

Abstract

We show that, for a constant-degree algebraic curve γ in RD, every set of n points on γ spans at least (n4/3) distinct distances, unless γ is an algebraic helix (see Definition 1.1). This improves the earlier bound (n5/4) of Charalambides [Discrete Comput. Geom. (2014)]. We also show that, for every set P of n points that lie on a d-dimensional constant-degree algebraic variety V in RD, there exists a subset S⊂ P of size at least (n49+12(d-1)), such that S spans |S|2 distinct distances. This improves the earlier bound of (n13d) of Conlon et al. [SIAM J. Discrete Math. (2015)]. Both results are consequences of a common technical tool, given in Lemma 2.7 below.

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…