Popular distances in 3-space (Q1301635)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1334443
Language Label Description Also known as
default for all languages
No label defined
    English
    Popular distances in 3-space
    scientific article; zbMATH DE number 1334443

      Statements

      Popular distances in 3-space (English)
      0 references
      0 references
      0 references
      0 references
      20 December 1999
      0 references
      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.
      0 references
      Erdős problems
      0 references
      extremal problems
      0 references
      sets of distances of \(n\) points
      0 references
      directed graph
      0 references

      Identifiers