Nearly equal distances in the plane, II
P. Erd\H{o}s, E. Makai, Jr., J. Pach

TL;DR
This paper investigates the distribution of distances among separated points in the plane, establishing bounds on the number of pairs with distances in specified intervals under certain ratio conditions.
Contribution
It provides a new upper bound on the number of point pairs with distances in specified ranges, extending understanding of distance distributions in separated point sets.
Findings
Bound on pairs with distances in specified intervals is at most n^2/4 + C_{k,δ}n.
Result is sharp up to a constant factor.
Conditions on ratios of interval endpoints are crucial for the bound.
Abstract
Let be a separated point set, i.e., any two points have a distance at least . Let be an integer, and be real numbers. Let . Suppose for all that . Then for , the number of pairs , for which , is at most . This is sharp, up to the value of the constant .
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
TopicsUrbanization and City Planning · Meromorphic and Entire Functions · Mathematical Approximation and Integration
