scientific article; zbMATH DE number 17642
[For the entire collection see Zbl 0726.00015.] Given \(n\) real numbers mutually differing by at least 1, let \(1\leq d_1\leq\dots\leq d_m\), \(m=\binom{n}{2}\), denote the increasing sequence of differences between them. The authors prove the asymptotically sharp bound \[ \sum_{j=1}^{m-1}(d_{j+1}-d_j)^2>c\cdot\log n, \] and give sharp lower bounds for \(\sum_{j=1}^{m-1}\phi(d_{j+1}-d_j)\) for large class of monotone increasing convex functions \(\phi\). They also show that for \(n\) points in the plane with minimal distance 1 and any real number \(t\) at most \(\lceil n^2/4\rceil\) may have distances between \(t\) and \(t+1\), and give an analogous result in terms of the diameter of the point set.
- Uniformly distributed distances -- a geometric application of Janson's inequality
- Extremal circular permutations with concave functions
- Nearly equal distances and Szemerédi's regularity lemma
- Gaps between fractional parts, and additive combinatorics
- Nearly Equal Distances in the Plane
- The factor-difference set of integers
- Nearly k-distance sets
- Annulus graphs in \(\mathbb{R}^d\)
- Nearly \(k\)-distance sets
- On the diameter of separated point sets with many nearly equal distances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974970)
