Approximate Euclidean Ramsey theorems

zbMATH Open1422.11016arXiv1004.1654MaRDI QIDQ2968074FDOQ2968074

Authors: Adrian Dumitrescu 

Publication date: 9 March 2017

Abstract: According to a classical result of Szemer'{e}di, every dense subset of $1,2,\mathrm{...},N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F"urstenberg and Katznelson says that every dense subset of ${1,2,\mathrm{...},N}^d$ contains an arbitrary large grid, if $N$ is large enough. Here we generalize these results for separated point sets on the line and respectively in the Euclidean space: (i) every dense separated set of points in some interval $[0,L]$ on the line contains an arbitrary long approximate arithmetic progression, if $L$ is large enough. (ii) every dense separated set of points in the $d$-dimensional cube $[0,L{]}^d$ in $R{R}^d$ contains an arbitrary large approximate grid, if $L$ is large enough. A further generalization for any finite pattern in $R{R}^d$ is also established. The separation condition is shown to be necessary for such results to hold. In the end we show that every sufficiently large point set in $R{R}^d$ contains an arbitrarily large subset of almost collinear points. No separation condition is needed in this case.

Full work available at URL: https://arxiv.org/abs/1004.1654

Recommendations

• 𝐼𝑃_𝑟-sets, Szemerédi’s theorem, and Ramsey theory
• Lines in Euclidean Ramsey theory
• Distinct distances and arithmetic progressions
• On the diameter of separated point sets with many nearly equal distances
• Euclidean Ramsey theorems. I

zbMATH Keywords

Euclidean Ramsey theoryalmost collinear pointsapproximate arithmetic progressionapproximate homothetic copy

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Arithmetic progressions (11B25)

Cited In (3)

• Approximate Euler characteristic, dimension, and weak pigeonhole principles
• A blurred view of Van der Waerden type theorems
• On visibility problems with an infinite discrete set of obstacles

This page was built for publication: Approximate Euclidean Ramsey theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968074)