A problem of Erd\H{o}s about rich distances
Krishnendu Bhowmick

TL;DR
This paper addresses Erdős's old question by constructing point sets with many distances occurring more than a linear number of times, providing affirmative answers and generalizations to the problem.
Contribution
The paper constructs explicit point sets demonstrating that many distances can occur more than n times, answering Erdős's question affirmatively and generalizing the result.
Findings
Existence of point sets with loor(n/4)istances occurring more than n times
Generalization to sets with c_m n distances occurring more than n+m times
Provides explicit constructions for these point sets
Abstract
An old question posed by Erd\H{o}s asked whether there exists a set of points such that distances occur more than times. We provide an affirmative answer to this question, showing that there exists a set of points such that distances occur more than times. We also present a generalized version, finding a set of points where distances occurring more than times.
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
TopicsAdvanced Topology and Set Theory · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
