Abstract
Let \({{\left\{x_{1}, \dots, x_{n}\right\}\subset \mathbb{R}^2}}\) be a set of points in the unit circle. It is shown that
which is best possible and improves earlier results by Arpacioglu and Haas and Xia and Liu.
Similar content being viewed by others
References
Arpacioglu O., Haas Z.: On the scalability and capacity of planar wireless networks with omnidirectional antennas. Wirel. Commun. Mob. Comput. 4, 263–279 (2004)
Benassi C., Malagoli F.: The sum of squared distances under a diameter constraint. in arbitrary dimension, Arch. Math. 90, 471–480 (2008)
Pillichshammer F.: On the sum of squared distances in the Euclidean plane. Arch. Math. 74, 472–480 (2000)
Witsenhausen H.: On the maximum of the sum of squared distances under a diameter constraint. Amer. Math. Monthly 81, 1100–1101 (1974)
Y. Xia and H. Liu, Improving upper bound on the capacity of planar wireless networks with omnidirectional antennas, in: B. Yuan and X. Tang (eds.) Proceedings of the IET 2nd International Conference on Wireless, Mobile & Multimedia Networks, 191–194, 2008.
Y. Xia and H. Liu, On the interpoint distance sum inequality, JIPAM. J. Inequal. Pure Appl. Math. 10, no. 3, Article 74, 10 pp (2009).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Austrian Science Foundation (FWF), Project S9609, which is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.
Rights and permissions
About this article
Cite this article
Steinerberger, S. On the optimal interpoint distance sum inequality. Arch. Math. 97, 289–298 (2011). https://doi.org/10.1007/s00013-011-0293-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-011-0293-7