English

Distinct distances for points lying on curves in $\mathbb{R}^d$ -- the bipartite case

Combinatorics 2023-04-17 v1

Abstract

Let γ1,γ2\gamma_1,\gamma_2 be a pair of constant-degree irreducible algebraic curves in Rd\mathbb{R}^d. Assume that γi\gamma_i is neither contained in a hyperplane nor in a quadric surface in Rd\mathbb{R}^d, for each i=1,2i=1,2. We show that for every pair of nn-point sets P1γ1P_1\subset\gamma_1 and P2γ2P_2\subset\gamma_2, the number of distinct distances spanned by P1×P2P_1\times P_2 is Ω(n3/2)\Omega(n^{3/2}), with a constant of proportionality that depends on degγ1{\rm deg}\gamma_1, degγ2{\rm deg}\gamma_2, and dd. This extends earlier results of Charalambides [Char], Pach and De Zeeuw [PdZ], and Raz [Ra] to the bipartite version. For the proof we use rigidity theory, and in particular the description of Bolker and Roth [BR80] for realizations in Rd\mathbb{R}^d of the complete bipartite graph Km,nK_{m,n} that are not infinitesimally rigid.

Keywords

Cite

@article{arxiv.2304.06812,
  title  = {Distinct distances for points lying on curves in $\mathbb{R}^d$ -- the bipartite case},
  author = {Hadas Baer-Erenfeld and Orit E. Raz},
  journal= {arXiv preprint arXiv:2304.06812},
  year   = {2023}
}