English

On Distinct Distances Between a Variety and a Point Set

Combinatorics 2019-08-21 v3

Abstract

We consider the problem of determining the number of distinct distances between two point sets in R2\mathbb{R}^2 where one point set P1\mathcal{P}_1 of size mm lies on a real algebraic curve of fixed degree rr, and the other point set P2\mathcal{P}_2 of size nn is arbitrary. We prove that the number of distinct distances between the point sets, D(P1,P2)D(\mathcal{P}_1,\mathcal{P}_2), satisfies D(P1,P2)=Ω(m1/2n1/2log1/2n)D(\mathcal{P}_1,\mathcal{P}_2) = \Omega(m^{1/2}n^{1/2}\log^{-1/2}n) when m=Ω(n1/2log1/3n)m = \Omega(n^{1/2}\log^{-1/3}n) and D(P1,P2)=Ω(n1/2m1/3)D(\mathcal{P}_1,\mathcal{P}_2) = \Omega(n^{1/2} m^{1/3}) when m=O(n1/2log1/3n)m=O(n^{1/2}\log^{-1/3}n) This generalizes work of Pohoata and Sheffer, and complements work of Pach and de Zeeuw.

Keywords

Cite

@article{arxiv.1812.03371,
  title  = {On Distinct Distances Between a Variety and a Point Set},
  author = {Bryce McLaughlin and Mohamed Omar},
  journal= {arXiv preprint arXiv:1812.03371},
  year   = {2019}
}

Comments

8 pages

R2 v1 2026-06-23T06:36:20.885Z