A product inequality for extreme distances
This paper considers a question somewhat in the same spirit as the Erdős unit distance problem, but with a focus on the extreme distances. Given a set \(P \subset \mathbb R^2\) of \(n\) points in the plane, let \(d_{\min}\) denote the minimum distance between two distinct points of \(P\), and let \(d_{\max}\) denote the maximum distance. Let \(s_{\min}\) denote the number of unordered pairs of elements of \(P\) which are a distance \(d_{\min}\) apart, and let \(s_{\max}\) denote the number of unordered pairs of elements of \(P\) which are a distance \(d_{\max}\) apart. How large can the product \(s_{\min}\cdot s_{\max}\) possibly be (as a function of \(n\))? This is the question which is answered here. A construction of Makai Jr. shows that it is possible to have \[ s_{\min}\cdot s_{\max} \geq \frac{9}{8}n^{2} - O(n^{3/2}). \] This construction is illustrated nicely in the paper under review. The main result of this paper provides an essentially matching upper bound for this product, thus answering a question of \textit{P. Erdős} and \textit{J. Pach} [Combinatorica 10, No. 3, 261--269 (1990; Zbl 0722.52009)]. It is proven that \[ s_{\min}\cdot s_{\max} \leq \frac{9}{8}n^{2} + O(n). \]
- scientific article; zbMATH DE number 7760177
- Unit distances
- On the approximate unit distance problem
- A product inequality for extreme distances
- Erdös distance problems in normed spaces
- Favorite distances in high dimensions
- scientific article; zbMATH DE number 1234826
- The number of unit distances is almost linear for most norms
- The additive structure of Cartesian products spanning few distinct distances
- On the number of discrete chains
This page was built for publication: A product inequality for extreme distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175441)
