Uniformly distributed distances: A geometric application of Jansen's inequality
| dc.creator | Pach, János | |
| dc.creator | Spencer, Joel | |
| dc.date | 1996-05-10 | |
| dc.date.accessioned | 2026-07-07T09:15:31Z | |
| dc.date.available | 2026-07-07T09:15:31Z | |
| dc.description | Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1 \geq 1$. This bound is asymptotically tight. | |
| dc.identifier | https://arxiv.org/abs/math/9605221 | |
| dc.identifier | http://arxiv.org/abs/math/9605221 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/153046 | |
| dc.subject | Metric Geometry | |
| dc.title | Uniformly distributed distances: A geometric application of Jansen's inequality | |
| dc.type | text |