The two largest distances in finite planar sets
From MaRDI portal
Publication:1916127
Let \(S\) be a set of \(n\) points in the Euclidean plane \(\mathbb{R}^2\). Let \(n_1\) and \(n_2\) denote the number of times the largest and second largest distances occur among points in \(S\). It is well known that \(n_1 \leq n\). In this paper, a complete set of homogeneous linear inequalities involving \(n\), \(n_1\) and \(n_2\) is given by Theorem: For any set of \(n\) points in \(\mathbb{R}^2\), (0) \(n_1 \leq n\), (i) \(n_2 \leq 3n/2\), (ii) \(n_2 \leq n + 2n_1\), (iii) \(n_1 + n_2 \leq 2n\).
Recommendations
Cites work
Cited in
(11)- On the distribution of distances in finite sets in the plane
- On large distances in planar sets
- The maximum number of second smallest distances in finite planar sets
- Circle grids and bipartite graphs of distances
- The maximum number of odd integral distances between points in the plane
- Large simplices determined by finite point sets
- The distance-2-sets of the slim dense near hexagons
- scientific article; zbMATH DE number 3896939 (Why is no real title available?)
- scientific article; zbMATH DE number 3907269 (Why is no real title available?)
- The Number of Furthest Neighbour Pairs of a Finite Planar Set
- Minimum planar sets with maximum equidistance counts
This page was built for publication: The two largest distances in finite planar sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916127)