Uniformly distributed distances - A geometric application of Janson's inequality

János Pach, Joel Spencer

Research output: Contribution to journalArticle

Abstract

Let d1 ≤ d2 ≤ . . . ≤ d(n2) denote the distances determined by n points in the plane. It is shown that min Σi(di+1-di)2=O(n -6/7), where the minimum is taken over all point sets with minimal distance d1 ≥ 1. This bound is asymptotically tight.

Original languageEnglish (US)
Pages (from-to)111-124
Number of pages14
JournalCombinatorica
Volume19
Issue number1
StatePublished - 1999

Fingerprint

Point Sets
Denote

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Uniformly distributed distances - A geometric application of Janson's inequality. / Pach, János; Spencer, Joel.

In: Combinatorica, Vol. 19, No. 1, 1999, p. 111-124.

Research output: Contribution to journalArticle

@article{2535a10acd744bf0af47797e095f99c2,
title = "Uniformly distributed distances - A geometric application of Janson's inequality",
abstract = "Let d1 ≤ d2 ≤ . . . ≤ d(n2) denote the distances determined by n points in the plane. It is shown that min Σi(di+1-di)2=O(n -6/7), where the minimum is taken over all point sets with minimal distance d1 ≥ 1. This bound is asymptotically tight.",
author = "J{\'a}nos Pach and Joel Spencer",
year = "1999",
language = "English (US)",
volume = "19",
pages = "111--124",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",

}

TY - JOUR

T1 - Uniformly distributed distances - A geometric application of Janson's inequality

AU - Pach, János

AU - Spencer, Joel

PY - 1999

Y1 - 1999

N2 - Let d1 ≤ d2 ≤ . . . ≤ d(n2) denote the distances determined by n points in the plane. It is shown that min Σi(di+1-di)2=O(n -6/7), where the minimum is taken over all point sets with minimal distance d1 ≥ 1. This bound is asymptotically tight.

AB - Let d1 ≤ d2 ≤ . . . ≤ d(n2) denote the distances determined by n points in the plane. It is shown that min Σi(di+1-di)2=O(n -6/7), where the minimum is taken over all point sets with minimal distance d1 ≥ 1. This bound is asymptotically tight.

UR - http://www.scopus.com/inward/record.url?scp=0040707342&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040707342&partnerID=8YFLogxK

M3 - Article

VL - 19

SP - 111

EP - 124

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -