Some examples of repetitive, nonrectifiable Delone sets (Q315261): Difference between revisions

A Delone set in \(\mathbb R^d\) is a uniformly discrete and relatively dense set \(\mathcal D\) of points of \(\mathbb R^d\), i.e., there exist positive constants \(\rho\) and \(\varrho\) such that the distance between every two different points of \(\mathcal D\) is not less than \(\rho\) and for any point of \(\mathbb R^d\) there is a point of \(\mathcal D\) such that the distance between the two points is not greater than \(\varrho\). A set is said to be repetitive if a translated copy of each patch appears in every large enough ball. A Delone set \(\mathcal D \subset \mathbb R^d\) is said to be rectifiable if it is bi-Lipschitz equivalent to \(\mathbb Z^d\), which means that there exists a bijection \(f : \mathcal D \to \mathbb Z^d\) and a real number \(L \geq 1\) such that for all \(x\), \(y\) from \(\mathcal D\), \[ \frac{\| x - y \|}{L} \leq \|f(x) - f(y)\| \leq L\|x - y\|. \] The question of the existence of nonrectifiable Delone sets in \(\mathbb R^d\), for \(d \geq 2\), was raised by M. Gromov. \textit{D. Burago} and \textit{B. Kleiner} [Geom. Funct. Anal. 12, No. 1, 80--92 (2002; Zbl 1165.26007)] and, independently, \textit{C. T. McMullen} [Geom. Funct. Anal. 8, No. 2, 304--314 (1998; Zbl 0941.37030)] gave examples of Delone sets that are not bi-Lipschitz equivalent to the standard lattice. In the paper under review the authors refine the methods of construction developed by the above mentioned authors by using a discretization technique. They construct the first examples of nonrectifiable Delone sets which are repetitive.