Papers
Topics
Authors
Recent
Search
2000 character limit reached

Incidences in Three Dimensions and Distinct Distances in the Plane

Published 6 May 2010 in cs.CG | (1005.0982v1)

Abstract: We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set SS of ss points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in three dimensions. We offer conjectures involving the new setup, but are still unable to fully resolve them. Instead, we adapt the recent new algebraic analysis technique of Guth and Katz \cite{GK}, as further developed by Elekes et al. \cite{EKS}, to obtain sharp bounds on the number of incidences between these helices or parabolas and points in R<sup>3\reals<sup>3. Applying these bounds, we obtain, among several other results, the upper bound O(s<sup>3)O(s<sup>3) on the number of rotations (rigid motions) which map (at least) three points of SS to three other points of SS. In fact, we show that the number of such rotations which map at least k3k\ge 3 points of SS to kk other points of SS is close to O(s<sup>3/k<sup>12/7)O(s<sup>3/k<sup>{12/7}). One of our unresolved conjectures is that this number is O(s<sup>3/k<sup>2)O(s<sup>3/k<sup>2), for k2k\ge 2. If true, it would imply the lower bound Ω(s/logs)\Omega(s/\log s) on the number of distinct distances in the plane.

Authors (2)
Citations (103)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.