The number of different distances determined by n points in the plane
From MaRDI portal
Let f(n) be the minimum number of different distances determined by n points in the Euclidean plane. It is shown that f(n) \(cn^{5/7}\) for a fixed constant c.
Cites work
Cited in
(18)- On distinct distances among points in general position and other related problems
- On some metric and combinatorial geometric problems
- Lattices with few distances
- The number of different distances determined by a set of points in the Euclidean plane
- Cardinalities of k-distance sets in Minkowski spaces
- On distinct sums and distinct distances.
- The maximum number of odd integral distances between points in the plane
- Finite point configurations in the plane, rigidity and Erdős problems
- On bipartite distinct distances in the plane
- Distinct distances on non-ruled surfaces and between circles
- On the geometric structures with n points and k distances
- On the Hausdorff dimensions of distance sets
- scientific article; zbMATH DE number 850784 (Why is no real title available?)
- scientific article; zbMATH DE number 865979 (Why is no real title available?)
- Incidences in three dimensions and distinct distances in the plane
- On Erdős chains in the plane
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- A note on the number of different inner products generated by a finite set of vectors
This page was built for publication: The number of different distances determined by n points in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791525)