English

Nearly equal distances in the plane, II

Combinatorics 2025-10-08 v2 Metric Geometry

Abstract

Let {p1,,pn}R2\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2 be a separated point set, i.e., any two points have a distance at least 11. Let k1k \ge 1 be an integer, and 1t1<<tk1 \le t_1 < \ldots < t_k be real numbers. Let δ>0\delta > 0. Suppose for all 1(1)(2)<(3)k1 \le \ell (1) \le \ell (2) < \ell (3) \le k that t(3)/(t(1)+t(2))1δ|t_{\ell (3)} / (t_{\ell (1)} + t_{\ell (2)}) - 1| \ge \delta . Then for nnk,δn \ge n_{k, \delta }, the number of pairs {pi,pj}\{ p_i,p_j\} , for which d(pi,pj)[t1,t1+1][tk,tk+1]d(p_i,p_j) \in [t_1, t_1 + 1] \cup \ldots \cup [t_k, t_k + 1] , is at most n2/4+Ck,δnn^2/4 + C_{k,\delta }n. This is sharp, up to the value of the constant Ck,δ>0C_{k,\delta } > 0.

Keywords

Cite

@article{arxiv.2112.08852,
  title  = {Nearly equal distances in the plane, II},
  author = {P. Erdős and E. Makai, and J. Pach},
  journal= {arXiv preprint arXiv:2112.08852},
  year   = {2025}
}

Comments

9 pages

R2 v1 2026-06-24T08:20:18.994Z