On multiplicities of interpoint distances
Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu

TL;DR
This paper investigates the maximum and minimum possible multiplicities of distances determined by point sets in the plane, revealing new bounds and constructions related to Erdős's questions on distance multiplicities.
Contribution
It provides new bounds on distance multiplicities for convex and general point sets, and constructs examples with high multiplicity and prescribed multiplicity patterns.
Findings
Convex sets have a distance with multiplicity at most n.
Existence of point sets with superlinear multiplicity for many distances.
Construction of point sets with prescribed large differences in multiplicity.
Abstract
Given a set of points and a distance , the multiplicity of is the number of times the distance appears between points in . Let denote the multiplicities of the distances determined by and let . In this paper, we study several questions from Erd\H{o}s's time regarding distance multiplicities. Among other results, we show that: (1) If is convex or ``not too convex'', then there exists a distance other than the diameter that has multiplicity at most . (2) There exists a set of points, such that many distances occur with high multiplicity. In particular, at least distances have superlinear multiplicity in . (3) For any (not necessarily fixed) integer , there…
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
