Nearly equal distances and Szemerédi's regularity lemma (Q2489544)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Nearly equal distances and Szemerédi's regularity lemma
scientific article

    Statements

    Nearly equal distances and Szemerédi's regularity lemma (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    An aim of this note is the following theorem: Let \(\varepsilon >0\) be fixed and let \(P\) be a separated set of \(n\) points in \(\mathbb{R}^3\) containing at least \(\varepsilon n^2\) pairs \((u,v)\), \(u,v\in P\), with \(\|u-v\|\in[t,t+1]\) for some fixed real number \(t>0\). Then the diameter of \(P\) is at least constant times \(n\) \((\text{diam}(P)=\Omega(n))\). At this a point set is called separated if the minimum distance between two elements is one. This result proves a conjecture by \textit{P. Erdős} [Am. Math. Mon. 53, 248--250 (1946; Zbl 0060.34805)] and \textit{P. Erdős}, \textit{E. Makai} and \textit{J. Pach} [Comb. Probab. Comput. 2, No. 4, 401--408 (1993; Zbl 0798.52017)]. In the proof the Szemerédi's regularity lemma and a Ramsey-type result for dot products of vectors are used.
    0 references
    Erdős problems
    0 references
    repeated distances
    0 references
    separated sets
    0 references

    Identifiers