The main problem of this paper is: What is the smallest integer \(m(n)\) with the property that any set of \(n\) points in Euclidean 3-space has an element such that at most \(m\) other points are equidistant from it? The authors obtain the following valuation: \[ c n^{1/3} \log\log n\leq m(n) \leq n^{3/5} \beta(n), \] where \(c>0\) is a constant and \(\beta(n)\) is an extremely slowly growing function, related to the inverse of the Ackermann function.
Recommendations
Cites work
- Combinatorial complexity bounds for arrangements of curves and spheres
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- scientific article; zbMATH DE number 3153711 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- On a problem of K. Zarankiewicz
- On Sets of Distances of n Points
- Repeated distances in space
- Variations on the theme of repeated distances
Cited in
(7)
This page was built for publication: Popular distances in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301635)