Jazsef Solymosi
ABSTRACT
We show that the number of distinct distances in a well-distributed set of n points in Rd is O (n2/d-1/d2) which is not far from the best known upper bound O(n2/d).
- Aronov, Pach, Sharir, and Tardos. Distinct distances in three and higher dimensions. Manuscript, 2003.Google Scholar
- Clarkson, Edelsbrunner, Guibas, Sharir, and Welzl. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete and Computational Geometry, 5, 1990.Google Scholar
- Erdos. On sets of distances of n points. Amer. Math. Monthly, 53:248--250, 1946.Google ScholarCross Ref
- Iosevich. Curvature, combinatorics, and the fourier transform. Notices of the American Mathematical Society, 48, 2001.Google Scholar
- Solymosi, Tardos, and Toth. The k most frequent distances in the plane. Discrete and Computational Geometry, 28, 2002.Google Scholar
- Solymosi and Toth. Distinct distances in the plane. Discrete and Computational Geometry, 25, 2001.Google Scholar
Index Terms
- Distinct distances in homogeneous sets
Recommendations
Distinct Distances in Homogeneous Sets in Euclidean Space
It is shown that every homogeneous set of n points in d-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant c(d) > 0. In three-space the above general bound is slightly improved ...
Uniqueness of maximum planar five-distance sets
A subset X in the Euclidean plane is called a k-distance set if there are exactly k distances between two distinct points in X. We denote the largest possible cardinality of k-distance sets by g(k). Erdos and Fishburn proved that g(5)=12 and also ...
A Proof of a Dodecahedron Conjecture for Distance Sets
AbstractA finite subset of a Euclidean space is called an s-distance set if there exist exactly s values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all 5-distance sets in
Comments