Distinct distances for points lying on curves in Rd -- the bipartite case
Abstract
Let γ1,γ2 be a pair of constant-degree irreducible algebraic curves in Rd. Assume that γi is neither contained in a hyperplane nor in a quadric surface in Rd, for each i=1,2. We show that for every pair of n-point sets P1⊂γ1 and P2⊂γ2, the number of distinct distances spanned by P1× P2 is (n3/2), with a constant of proportionality that depends on degγ1, degγ2, and d. 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 of the complete bipartite graph Km,n that are not infinitesimally rigid.
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.