pith. machine review for the scientific record. sign in

arxiv: 1302.3081 · v2 · submitted 2013-02-13 · 🧮 math.CO · cs.CG

Recognition: unknown

Distinct distances on two lines

Authors on Pith no claims yet
classification 🧮 math.CO cs.CG
keywords distancesdistinctomegacontainedlinenumberthenbound
0
0 comments X
read the original abstract

Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs of P_1xP_2 is \Omega(\min{|P_1|^{2/3}|P_2|^{2/3},|P_1|^2, |P_2|^2}). In particular, if |P_1|=|P_2|=m, then the number of these distinct distances is \Omega(m^{4/3}), improving upon the previous bound \Omega(m^{5/4}) of Elekes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.