Distinct Distances: Open Problems and Current Bounds
Adam Sheffer
TL;DR
This paper surveys various versions of Erdős' distinct distances problem, highlighting open questions and summarizing the latest bounds achieved in the field.
Contribution
It provides a comprehensive overview of open problems and current bounds related to the distinct distances problem.
Findings
Summary of current best bounds for each variant
Identification of open problems in the field
Comparison of different approaches and results
Abstract
We survey the variants of Erd\H{o}s' distinct distances problem and the current best bounds for each of those.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Complexity and Algorithms in Graphs · Advanced Graph Theory Research