Favorite Distances in High Dimensions

Chapter
First Online:

Abstract

Let S be a set of n points in \({\mathbb{R}}^{d}\). Assign to each x ∈ S an arbitrary distance r(x) > 0. Let e r (x, S) denote the number of points in S at distance r(x) from x. Avis, Erdős, and Pach (1988) introduced the extremal quantity \({f}_{d}(n) =\max \sum\limits_{\mathbf{x}\in S}{e}_{r}(\mathbf{x},S)\), where the maximum is taken over all n-point subsets S of \({\mathbb{R}}^{d}\) and all assignments \(r: S \rightarrow (0,\infty )\) of distances.

We give a quick derivation of the asymptotics of the error term of f d (n) using only the analogous asymptotics of the maximum number of unit distance pairs in a set of n points:
$${f}_{d}(n) = \left(1 - \frac{1} {\lfloor d/2\rfloor }\right){n}^{2}+\left\{\begin{array}{@{}l@{\quad }l@{}} \Theta (n) \quad &\text{ if}\ d\ \text{ is even,} \\ \Theta {((n/d))}^{4/3})\quad &\text{ if}\ d\ \text{ is odd.} \end{array} \right.$$
The implied constants are absolute. This improves on previous results of Avis, Erdős, and Pach (1988) and Erdős and Pach (1990).

Then we prove a stability result for d ≥ 4, asserting that if (S, r) with \(\left\vert S\right\vert = n\) satisfies \({e}_{r}(S) = {f}_{d}(n) - o({n}^{2})\), then, up to o(n) points, S is a Lenz construction with r constant. Finally, we use stability to show that for n sufficiently large (depending on d), the pairs (S, r) that attain f d (n) are up to scaling exactly the Lenz constructions that maximize the number of unit distance pairs with r ≡ 1, with some exceptions in dimension 4.

Analogous results hold for the furthest-neighbor digraph, where r is fixed to be \(r(\mathbf{x}) {=\max }_{\mathbf{y}\in S}\vert \mathbf{x}\mathbf{y}\vert\) for x ∈ S.

This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

The author would like to thank the anonymous referee for careful proofreading and good advice on a previous version.

References

  1. 1.
    B. Aronov, M. Sharir, Cutting circles into pseudo-segments and improved bounds for incidences. Discrete Comput. Geom. 28, 475–49 (2002)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    D. Avis, The number of furthest neighbour pairs of a finite planar set. Am. Math. Mon. 91, 417–420 (1984)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    D. Avis, P, Erdős, J. Pach, Repeated distances in space. Graphs Combin. 44, 207–217 (1988)Google Scholar
  4. 4.
    P. Brass, On the maximum number of unit distances among n points in dimension four, in Intuitive Geometry, ed. by I. Bárány et al. Bolyai Soc. Mathematical Studies, vol. 6 (1997), pp. 277–290. See also the review of this paper in Mathematical Reviews MR 98j:52030.Google Scholar
  5. 5.
    P. Brass, W.O.J. Moser, J. Pach, Research Problems in Discrete Geometry (Springer, Berlin, 2005)MATHGoogle Scholar
  6. 6.
    W.G. Brown, M. Simonovits, Extremal multigraph and digraph problems, in Paul Erdős and His Mathematics, vol. 2, ed. by G. Halász et al. Bolyai Soc. Mathematical Studies, vol. 11 (2002), pp. 157–203Google Scholar
  7. 7.
    G. Csizmadia, Furthest neighbours in space. Discrete Math. 150, 81–88 (1996)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    H. Edelsbrunner, S. S. Skiena, On the number of furthest neighbour pairs in a point set. Am. Math. Mon. 96, 614–618 (1989)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    P. Erdős, On sets of distances of n points in Euclidean space. Magyar Tud. Akad. Mat. Kut. Int. Közl. 5, 165–169 (1960)Google Scholar
  10. 10.
    P. Erdős, On some applications of graph theory to geometry. Can. J. Math. 19, 968–971 (1967)CrossRefGoogle Scholar
  11. 11.
    P. Erdős, J. Pach, Variations on the theme of repeated distances. Combinatorica 10, 261–269 (1990)MathSciNetCrossRefGoogle Scholar
  12. 12.
    K.J. Swanepoel, Unit distances and diameters in Euclidean spaces. Discrete Comput. Geom. 41, 1–27 (2009)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    K.J. Swanepoel, Favourite distances in 3-space, Manuscript.Google Scholar
  14. 14.
    P. van Wamelen, The maximum number of unit distances among n points in dimension four. Beiträge Algebra Geom. 40, 475–477 (1999)MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of MathematicsLondon School of Economics and Political ScienceLondonUK

Personalised recommendations