Distinct distances for points lying on curves in $\mathbb{R}^d$ -- the bipartite case
Combinatorics
2023-04-17 v1
Abstract
Let be a pair of constant-degree irreducible algebraic curves in . Assume that is neither contained in a hyperplane nor in a quadric surface in , for each . We show that for every pair of -point sets and , the number of distinct distances spanned by is , with a constant of proportionality that depends on , , and . 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 of the complete bipartite graph 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}
}